text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, r = 0, a[10000], a1[10000];
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> a1[i];
}
for (int w = 0; w < n; w++) {
for (int y = 0; y < n; y++) {
if (s > a[y] && a[y] != 10000) {
s += a1[y];
a[y] = 10000;
++r;
}
}
}
if (r >= n)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, x, y;
cin >> s >> n;
vector<pair<int, int>> v;
for (int i = 1; i <= n; i++) {
cin >> x >> y;
v.push_back(make_pair(x, y));
}
sort(v.begin(), v.end());
bool clear = true;
for (auto &it : v) {
if (s > it.first) {
s += it.second;
} else {
clear = false;
break;
}
}
cout << (clear ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int p = 1000000007;
int countbit(int n) { return n == 0 ? 0 : countbit(n / 2) + n % 2; }
int lowbit(int n) { return (n ^ (n - 1)) & n; }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long toInt64(string s) {
istringstream sin(s);
long long t;
sin >> t;
return t;
}
string toStr(long long t) {
stringstream sin;
sin << t;
string s;
sin >> s;
return s;
}
template <typename T>
T sqr(T n) {
return n * n;
}
template <typename T>
void out(T& v) {
for (int i = 0; i < v.size(); i++) cout << v[i] << ' ';
cout << endl;
}
class Timer {
public:
double start;
Timer() { start = static_cast<double>(clock()); }
void out() { cout << "TIME: " << (clock() - start) / CLOCKS_PER_SEC << endl; }
};
void solve() {
int s, n;
cin >> s >> n;
vector<pair<int, int> > v(n);
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v[i] = (make_pair((x), (y)));
}
sort((v).begin(), (v).end());
for (int i = 0; i < n; i++) {
if (v[i].first >= s) {
cout << "NO" << endl;
return;
}
s += v[i].second;
}
cout << "YES" << endl;
}
int main() {
cout.sync_with_stdio(false);
cin.sync_with_stdio(false);
solve();
return EXIT_SUCCESS;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int> > a;
long int s, n;
cin >> s >> n;
long int b, c;
for (long int i = 0; i < n; i++) {
cin >> b >> c;
a.push_back(make_pair(b, c));
}
sort(a.begin(), a.end());
for (long int i = 0; i < n; i++) {
if (a[i].first < s) {
s = s + a[i].second;
} else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, count = 0;
cin >> s >> n;
int arr[n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) cin >> arr[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (s <= arr[j][0]) continue;
if (s > arr[j][0] && arr[j][0] != -1 && arr[j][1] != -1) {
s = s + arr[j][1];
count += 1;
arr[j][0] = -1;
arr[j][1] = -1;
}
}
}
if (count == n)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
void merge(int arr1[], int arr2[], int l, int r, int m) {
int i, j, k;
int n1 = m - l + 1;
int n2 = r - m;
int left1[n1], right1[n2];
int left2[n1], right2[n2];
for (int i = 0; i < n1; i++) {
left1[i] = arr1[l + i];
left2[i] = arr2[l + i];
}
for (int j = 0; j < n2; j++) {
right1[j] = arr1[m + 1 + j];
right2[j] = arr2[m + 1 + j];
}
i = 0;
j = 0;
k = l;
while (i < n1 && j < n2) {
if (left1[i] <= right1[j]) {
arr1[k] = left1[i];
arr2[k] = left2[i];
i++;
} else {
arr1[k] = right1[j];
arr2[k] = right2[j];
j++;
}
k++;
}
while (i < n1) {
arr1[k] = left1[i];
arr2[k] = left2[i];
i++;
k++;
}
while (j < n2) {
arr1[k] = right1[j];
arr2[k] = right2[j];
j++;
k++;
}
}
void mergeSort(int arr1[], int arr2[], int l, int r) {
if (l < r) {
int m = (l + r) / 2;
mergeSort(arr1, arr2, l, m);
mergeSort(arr1, arr2, m + 1, r);
merge(arr1, arr2, l, r, m);
}
}
int main() {
int strength, numDragons;
cin >> strength >> numDragons;
int dragons[numDragons];
int bonus[numDragons];
for (int i = 0; i < numDragons; ++i) {
cin >> dragons[i] >> bonus[i];
}
mergeSort(dragons, bonus, 0, numDragons - 1);
int pos = 0;
for (int i = 0; i < numDragons; i++) {
if (strength > dragons[i]) {
strength += bonus[i];
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> vect;
int a, b;
for (int(i) = (0); i < (n); i++) {
cin >> a >> b;
vect.push_back(make_pair(a, b));
}
sort(vect.begin(), vect.end());
for (int(i) = (0); i < (n); i++) {
if (vect[i].first < s)
s += vect[i].second;
else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int m, n;
cin >> m >> n;
int k = n;
int w;
int* a = new int[n];
int* b = new int[n];
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
while (k > 0) {
w = 0;
for (int i = 0; i < n; i++) {
if (m > a[i]) {
m += b[i];
a[i] = 10030001;
w = 1;
k--;
}
}
if (w == 0) {
cout << "NO";
exit(0);
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int FFTMOD = 1007681537;
const int INF = (int)1e9;
const long long LINF = (long long)1e18;
const long double PI = acos((long double)-1);
const long double EPS = 1e-6;
pair<int, int> drag[1002];
bool cmpr(pair<int, int> a, pair<int, int> b) {
if (a.first == b.first) return a.second > b.second;
return a.first < b.first;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int s, n;
cin >> s >> n;
for (int i = (0); i < (n); ++i) cin >> drag[i].first >> drag[i].second;
sort(drag, drag + n, cmpr);
for (int i = (0); i < (n); ++i) {
if (s <= drag[i].first) {
cout << "NO" << '\n';
return 0;
}
s += drag[i].second;
}
cout << "YES" << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ks, cnt = 0;
cin >> ks >> n;
unsigned int ds[n], bns[n];
for (int i = 0; i < n; i++) {
cin >> ds[i] >> bns[i];
}
for (int i = 0; i < n;) {
if (ks > ds[i]) {
cnt++;
ds[i] = 100000000;
ks += bns[i];
i = 0;
} else {
i++;
}
}
if (cnt == n) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y;
} e[100005];
bool cmp(node a, node b) {
if (a.x == b.x) return a.y > b.y;
return a.x < b.x;
}
int main() {
int s, n;
scanf("%d%d", &s, &n);
for (int i = 1; i <= n; i++) {
cin >> e[i].x >> e[i].y;
}
sort(e + 1, e + 1 + n, cmp);
for (int i = 1; i <= n; i++) {
if (e[i].x < s) {
s += e[i].y;
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
pair<int, int> X[n];
for (int i = 0; i < n; i++) cin >> X[i].first >> X[i].second;
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (X[j].first < X[i].first) swap(X[j], X[i]);
int i;
for (i = 0; i < n; i++) {
if (X[i].first >= s) break;
s += X[i].second;
}
cout << (i == n ? "YES" : "NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool compare_points(pair<int, int> p1, pair<int, int> p2) {
if (p1.first - p2.first != 0)
return p1.first < p2.first;
else
return p1.second < p2.second;
}
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> dragons;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
dragons.push_back(make_pair(x, y));
}
sort(dragons.begin(), dragons.end(), compare_points);
for (int i = 0; i < n; i++) {
pair<int, int> val = dragons[i];
if (s > val.first) {
s += val.second;
} else if (s <= val.first) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
int x, y;
pair<int, int> p[n];
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
if (s > p[i].first) {
s += p[i].second;
} else
return cout << "NO" << endl, 0;
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[10000], b[10000];
int main() {
int n, s;
int swap;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++)
for (int i = 1; i < n; i++) {
if (a[i] < a[i - 1]) {
swap = a[i - 1];
a[i - 1] = a[i];
a[i] = swap;
swap = b[i - 1];
b[i - 1] = b[i];
b[i] = swap;
}
}
int i;
for (i = 0; i < n; i++) {
if (s > a[i])
s += b[i];
else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> drag[1001];
int main() {
int s = 0, n;
scanf("%d%d", &s, &n);
for (int i = 0; i < n; i++) scanf("%d%d", &drag[i].first, &drag[i].second);
sort(drag, drag + n);
for (int i = 0; i < n; i++)
if (s > drag[i].first)
s += drag[i].second;
else {
printf("NO");
return 0;
}
printf("YES");
return 0;
}
|
#include <bits/stdc++.h>
struct dr {
int s;
int p;
};
struct dr d[1000];
int compare(const void *a, const void *b) {
return ((*(struct dr *)a).s - (*(struct dr *)b).s);
}
int main() {
int s, n, i;
scanf("%d %d", &s, &n);
for (i = 0; i < n; i++) scanf("%d %d", &d[i].s, &d[i].p);
qsort(d, n, sizeof(d[0]), compare);
for (i = 0; i < n; i++) {
if (s > d[i].s)
s = s + d[i].p;
else {
printf("NO");
exit(0);
}
}
printf("YES");
exit(0);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long x, y, krito, bon, c, d, e, f, g, h, i, j, k, l, n, a, b;
while (scanf("%ld%ld", &x, &n) == 2) {
vector<pair<long, long> > sho;
krito = x;
for (i = 0; i < n; i++) {
scanf("%ld%ld", &a, &b);
sho.push_back(make_pair(a, b));
}
sort(sho.begin(), sho.end());
bool ans = true;
for (i = 0; i < n; i++) {
if (krito <= sho[i].first) {
ans = false;
break;
} else {
krito += sho[i].second;
}
}
if (ans == true)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
int x[1001], y[1001];
bool a[1001];
for (int i = 1; i <= n; i++) {
a[i] = true;
}
for (int i = 1; i <= n; i++) {
cin >> x[i] >> y[i];
}
bool tr = true;
int k = 1;
while (tr) {
k = 1;
for (int i = 1; i <= n; i++) {
if (a[i]) {
if (s > x[i]) {
s = s + y[i];
a[i] = false;
k++;
}
}
}
int z = 0;
for (int i = 1; i <= n; i++) {
if (a[i] == false) {
z++;
}
}
if (z == n) {
break;
}
if (k == 1) {
tr = false;
}
}
if (tr) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s, x, y;
vector<pair<int, int> > v;
int main() {
scanf("%d %d", &s, &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x, &y);
v.push_back(make_pair(x, y));
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (s <= v[i].first) {
printf("NO\n");
return 0;
} else {
s += v[i].second;
}
}
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int myXOR(long long int x, long long int y) {
return (x | y) & (~x | ~y);
}
long long int powerLL(long long int x, long long int n) {
long long int result = 1;
while (n) {
if (n & 1) result = result * x % 1000000007;
n = n / 2;
x = x * x % 1000000007;
}
return result;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int t, n, m, i, s, j, k, l, r;
cin >> s >> n;
long long int flg = 0;
multimap<long long int, long long int> mp;
while (n--) {
long long int a, b;
cin >> a >> b;
mp.insert(pair<long long int, long long int>(a, b));
}
for (auto ii = mp.begin(); ii != mp.end(); ii++) {
if (ii->first < s)
s += ii->second;
else {
flg = 1;
break;
}
}
if (flg)
cout << "NO";
else
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> mp(n);
for (int i = 0; i < n; ++i) {
int temp1, temp2;
cin >> temp1 >> temp2;
mp[i] = {temp1, temp2};
}
sort(mp.begin(), mp.end());
for (int i = 0; i < n; ++i) {
if (s <= mp[i].first) {
cout << "NO" << endl;
return;
}
s += mp[i].second;
}
cout << "YES" << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline int read() {
register int x = 0, t = 0;
register char c = getchar();
for (; c < '0' || c > '9'; t |= c == '-', c = getchar())
;
for (; c >= '0' && c <= '9';
x = (x << 3) + (x << 1) + (c ^ 48), c = getchar())
;
return t ? -x : x;
}
struct dragon {
int x, y;
bool operator<(dragon k) const { return x < k.x; }
} a[1000];
int m, n;
int main() {
m = read();
n = read();
for (register int i = 0; i < n; ++i) a[i].x = read(), a[i].y = read();
sort(a, a + n);
for (register int i = 0; i < n; ++i) {
if (m <= a[i].x) {
puts("NO");
return 0;
}
m += a[i].y;
}
puts("YES");
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAX = 100010;
int main() {
int s, n, a, b;
vector<pair<int, int> > v;
scanf("%d", &(s));
scanf("%d", &(n));
for (int i = 0, _n = (n); i < _n; ++i) {
scanf("%d", &(a));
scanf("%d", &(b));
v.push_back(make_pair(a, b));
}
sort((v).begin(), (v).end());
bool ok = 1;
for (int i = 0, _n = (n); i < _n; ++i) {
if (s > v[i].first)
s += v[i].second;
else {
ok = 0;
break;
}
}
cout << (ok ? "YES" : "NO") << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> vp;
int x, y;
for (int i = 0; i < n; i++) {
cin >> x >> y;
vp.push_back(make_pair(x, y));
}
sort(vp.begin(), vp.end());
for (int i = 0; i < n; i++) {
if (s > vp[i].first)
s += vp[i].second;
else {
cout << "NO\n";
return 0;
}
}
cout << "YES\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int s, n, x, y;
cin >> s >> n;
vector<pair<int, int>> d;
for (int i = 0; i < n; i++) {
cin >> x >> y;
d.push_back(make_pair(x, y));
}
sort(d.begin(), d.end());
string result = "YES\n";
for (vector<pair<int, int>>::iterator it = d.begin(); it != d.end(); it++) {
if (s <= it->first) {
result = "NO\n";
break;
} else {
s += it->second;
}
}
cout << result;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int s, n;
scanf("%lld%lld", &s, &n);
long long int ar[10001], ar2[10001];
for (long long int i = 0; i < n; i++) scanf("%lld%lld", &ar[i], &ar2[i]);
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < n; j++) {
if (s > ar[j] && ar[j] != -10) {
s = s + ar2[j];
ar[j] = -10;
}
}
}
for (long long int i = 0; i < n; i++) {
if (ar[i] != -10) {
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
int dragon, bouns;
long long sum = s;
bool res = false;
multimap<int, int> map1;
for (int i = 0; i < n; i++) {
cin >> dragon >> bouns;
map1.insert(pair<int, int>(dragon, bouns));
}
for (multimap<int, int>::iterator it = map1.begin(); it != map1.end(); it++) {
if (it->first < sum) {
sum += it->second;
} else {
res = true;
break;
}
}
if (res)
cout << "NO" << endl;
else
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int a;
int b;
} S[1001];
bool cmp(const node &a, const node &b) { return a.a < b.a; }
int main() {
int n, s, flag = 1;
cin >> s >> n;
for (int i = 0; i < n; i++) cin >> S[i].a >> S[i].b;
sort(S, S + n, cmp);
for (int i = 0; i < n; i++) {
if (s > S[i].a)
s += S[i].b;
else {
flag = 0;
break;
}
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
typedef struct str {
int x, y;
} * STRPTR;
void merge(STRPTR num[], int m) {
int i, j, l1, l2, u1, u2, k, size, flag;
STRPTR aux[m];
int r;
for (r = 1; r <= m; r++) aux[r] = (STRPTR)malloc(sizeof(struct str));
size = 1;
while (size < m) {
flag = 0;
l1 = 1;
k = 1;
while (l1 + size <= m) {
u1 = l1 + size - 1;
l2 = u1 + 1;
u2 = (l2 + size - 1 <= m) ? l2 + size - 1 : m;
i = l1;
j = l2;
while (i <= u1 && j <= u2)
if (num[i]->x < num[j]->x)
*aux[k++] = *num[i++];
else
*aux[k++] = *num[j++];
while (i <= u1) *aux[k++] = *num[i++];
while (j <= u2) *aux[k++] = *num[j++];
l1 = u2 + 1;
}
while (k <= m) *aux[k++] = *num[j++];
size *= 2;
if (size >= m)
break;
else
;
flag = 1;
l1 = 1;
k = 1;
while (l1 + size <= m) {
u1 = l1 + size - 1;
l2 = u1 + 1;
u2 = (l2 + size - 1 <= m) ? l2 + size - 1 : m;
i = l1;
j = l2;
while (i <= u1 && j <= u2)
if (aux[i]->x < aux[j]->x)
*num[k++] = *aux[i++];
else
*num[k++] = *aux[j++];
while (i <= u1) *num[k++] = *aux[i++];
while (j <= u2) *num[k++] = *aux[j++];
l1 = u2 + 1;
}
while (k <= m) *num[k++] = *aux[j++];
size *= 2;
}
if (flag == 1)
;
else if (flag == 0)
for (i = 1; i <= m; i++) *num[i] = *aux[i];
return;
}
void create(STRPTR s1[], int n) {
int i, a, b;
for (i = 1; i <= n; i++) {
s1[i] = (STRPTR)malloc(sizeof(struct str));
scanf("%d%d", &a, &b);
s1[i]->x = a;
s1[i]->y = b;
}
}
int main() {
int s, n, i, j, t;
scanf("%d%d", &s, &n);
t = s;
STRPTR s1[n];
create(s1, n);
merge(s1, n);
for (i = 1; i <= n; i++) {
if (t <= s1[i]->x) {
printf("NO");
return 0;
}
t += s1[i]->y;
}
printf("YES");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> v;
int s;
bool compare(pair<int, int> a, pair<int, int> b) { return a.first < b.first; }
int main() {
int n;
cin >> s >> n;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end(), compare);
for (int i = 0; i < n; i++) {
if (s > v[i].first) {
s += v[i].second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct node {
int x, y;
} xh[1003];
int cmp(struct node a, struct node b) { return a.x < b.x; }
int main() {
int n, s, i;
while (scanf("%d%d", &s, &n) != EOF) {
for (i = 0; i < n; i++) scanf("%d%d", &xh[i].x, &xh[i].y);
sort(xh, xh + n, cmp);
for (i = 0; i < n; i++) {
if (s > xh[i].x)
s += xh[i].y;
else
break;
}
if (i == n)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, c = 0;
cin >> s >> n;
pair<int, int> d[n];
for (int i = 0; i < n; i++) {
cin >> d[i].first >> d[i].second;
}
sort(d, d + n);
for (int i = 0; i < n; i++) {
if (s > d[i].first) {
s += d[i].second;
c++;
} else
break;
}
cout << ((c == n) ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s, n;
cin >> s >> n;
int arr[n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) cin >> arr[i][j];
}
for (int i = 0; i < n; i++) {
int min = arr[i][0];
for (int j = i + 1; j < n; j++) {
if (arr[j][0] < min) {
int t0 = arr[i][0];
int t1 = arr[i][1];
arr[i][0] = arr[j][0];
arr[i][1] = arr[j][1];
min = arr[j][0];
arr[j][0] = t0;
arr[j][1] = t1;
}
}
}
int f = 1, i = 0;
while (f == 1 && i < n) {
if (s > arr[i][0])
s += arr[i][1];
else {
f = 0;
break;
}
i++;
}
if (f == 0)
cout << "NO";
else
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, dragpow, dragBonuse;
vector<pair<int, int> > dragon;
cin >> s >> n;
while (n--) {
cin >> dragpow >> dragBonuse;
dragon.push_back(make_pair(dragpow, dragBonuse));
}
sort(dragon.begin(), dragon.end());
bool alive = true;
for (int i = 0; i < dragon.size(); i++) {
if (dragon[i].first >= s) {
alive = false;
break;
} else {
s += dragon[i].second;
}
}
if (alive) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[12345];
int main() {
int s, n, x, y;
scanf("%d %d", &s, &n);
for (int i = 0; i < n; i++) {
scanf("%d %d", &x, &y);
a[i] = make_pair(x, y);
}
sort(a, a + n);
bool ok = true;
for (int i = 0; i < n; i++) {
if (s > a[i].first)
s += a[i].second;
else {
ok = false;
break;
}
}
puts(ok ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int s, n, flag = 0;
scanf("%d%d", &s, &n);
int arr[n][2];
int i, j, temp;
for (i = 0; i < n; i++) {
for (j = 0; j < 2; j++) scanf("%d", &arr[i][j]);
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
if (arr[i][0] > arr[j][0]) {
temp = arr[i][0];
arr[i][0] = arr[j][0];
arr[j][0] = temp;
temp = arr[i][1];
arr[i][1] = arr[j][1];
arr[j][1] = temp;
}
}
}
for (i = 0; i < n; i++) {
if (s > arr[i][0]) {
s = s + arr[i][1];
} else {
flag = 1;
break;
}
}
if (flag == 0)
printf("YES");
else
printf("NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
int x[n], y[n];
int flag = 1;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
for (int i = 0; i < n; i++) v.push_back(make_pair(x[i], y[i]));
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (s > v[i].first) {
s += v[i].second;
} else {
cout << "NO";
flag = 0;
break;
}
}
if (flag == 1) {
cout << "YES";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int> > vec;
int points;
cin >> points;
int size;
cin >> size;
int n[size];
int s[size];
for (int i = 0; i < size; i++) {
cin >> n[i] >> s[i];
vec.push_back(make_pair(n[i], s[i]));
}
sort(vec.begin(), vec.end());
for (int i = 0; i < size; i++) {
if (points > vec[i].first) {
points = points + vec[i].second;
continue;
} else {
cout << "NO";
exit(0);
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
struct game {
int x, y;
};
int cmp(game a, game b) {
if (a.x < b.x)
return 1;
else
return 0;
}
game a[1010];
int main() {
int i, n, t;
while (cin >> t >> n) {
int k = 0;
for (i = 0; i < n; i++) cin >> a[i].x >> a[i].y;
sort(a, a + n, cmp);
for (i = 0; i < n; i++) {
if (t > a[i].x)
t += a[i].y;
else {
k = 1;
break;
}
}
if (k)
cout << "NO" << endl;
else
printf("YES\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
void solve(int cc) {
long long s, n;
cin >> s >> n;
vector<pair<long long, long long>> d(n);
for (int i = 0; i < n; i++) {
cin >> d[i].first >> d[i].second;
}
sort(
d.begin(), d.end(),
[&](const pair<long long, long long> aa,
const pair<long long, long long> bb) { return aa.first < bb.first; });
sort(d.begin(), d.end(),
[&](const pair<long long, long long> aa,
const pair<long long, long long> bb) {
if (aa.first == bb.first) return aa.second > bb.second;
return aa.first < bb.first;
});
for (auto p : d) {
s -= p.first;
if (s <= 0) {
cout << "NO" << '\n';
return;
}
s += p.second;
s += p.first;
}
cout << "YES" << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve(1);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> dragons;
bool flag = true;
int s, n, x, y;
int main() {
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> x >> y;
dragons.push_back({x, y});
}
sort(dragons.begin(), dragons.end());
for (int i = 0; i < n; i++) {
if (s > dragons[i].first)
s += dragons[i].second;
else {
flag = false;
break;
}
}
puts((flag) ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int INF = 1000000005;
long long INFF = 1000000000000000005LL;
int main() {
long long s, n;
cin >> s >> n;
long long x, y;
vector<pair<long long, long long>> strengths;
for (long long i = 0; i < n; i++) {
cin >> x >> y;
strengths.push_back(make_pair(x, y));
}
sort(strengths.begin(), strengths.end());
bool win = true;
for (long long i = 0; i < n; i++) {
if (s <= strengths[i].first) {
win = false;
break;
}
s += strengths[i].second;
}
if (win) {
cout << "YES"
<< "\n";
;
} else {
cout << "NO"
<< "\n";
;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int x, y, hold = 0, hold2 = 0;
cin >> x >> y;
vector<int> arr1;
vector<int> arr2;
for (int i = 0; i < y; i++) {
int a, b;
cin >> a;
arr1.push_back(a);
cin >> b;
arr2.push_back(b);
}
for (int i = 0; i < y; i++) {
hold = 0;
hold2 = 0;
for (int j = 0; j < y - 1; j++) {
if (arr1[j] > arr1[j + 1]) {
hold = arr1[j];
arr1[j] = arr1[j + 1];
arr1[j + 1] = hold;
hold2 = arr2[j];
arr2[j] = arr2[j + 1];
arr2[j + 1] = hold2;
}
}
}
for (int j = 0; j < y; j++) {
if (x > arr1[j]) {
x = x + arr2[j];
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int> > d;
for (int i = 0; i < n; i++) {
int x;
int y;
cin >> x >> y;
d.push_back(make_pair(x, y));
}
sort(d.begin(), d.end());
int win = 1;
for (int i = 0; i < n; i++) {
if (s > d[i].first)
s += d[i].second;
else {
win = 0;
break;
}
}
if (win)
cout << "YES";
else
cout << "NO";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> A;
while (n--) {
int x, y;
cin >> x >> y;
A.push_back(make_pair(x, y));
}
int f = 0;
sort(A.begin(), A.end());
for (auto x : A) {
if (s <= x.first) {
f = 1;
break;
} else
s = s + x.second;
}
f ? cout << "NO" : cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<long long, long long> > vect;
long long s, n, x, y, i;
cin >> s >> n;
long long sum = 0;
long long arr[n + 1], num[n + 1];
for (i = 0; i < n; i++) {
cin >> x >> y;
arr[i] = x;
num[i] = y;
}
for (i = 0; i < n; i++) {
vect.push_back(make_pair(arr[i], num[i]));
}
sort(vect.begin(), vect.end());
for (i = 0; i < n; i++) {
if (s > vect[i].first) {
s = s + vect[i].second;
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, i, flag = 0;
cin >> s >> n;
int x[n], y[n];
for (i = 0; i < n; i++) cin >> x[i] >> y[i];
for (i = 0; i < n; i++)
if (s > x[i] && x[i]) {
s = s + y[i];
x[i] = 0;
i = -1;
flag++;
}
cout << (flag == n ? "YES" : "NO");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, x, y;
cin >> n >> m;
vector<pair<int, int> > v;
bool passed = true;
while (m--) {
cin >> x >> y;
v.push_back(make_pair(x, y));
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size() && passed; i++) {
if (v[i].first < n) {
n += v[i].second;
} else
passed = false;
}
if (passed)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, s, i;
int flag = 0;
cin >> s >> n;
vector<pair<int, int> > v(n);
for (i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
for (i = 0; i < n; i++) {
if (s > v[i].first)
s += v[i].second;
else {
flag = 1;
break;
}
}
if (flag)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int NumberOfDragon, power;
cin >> power >> NumberOfDragon;
int i, count = 0;
pair<int, int> dragon[10000];
for (i = 0; i < NumberOfDragon; i++) {
cin >> dragon[i].first;
cin >> dragon[i].second;
}
sort(dragon, dragon + NumberOfDragon);
for (i = 0; i < NumberOfDragon; i++) {
if (power > dragon[i].first) {
power = power + dragon[i].second;
count++;
}
}
if (count == NumberOfDragon) {
cout << "YES";
} else {
cout << "NO";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, m = 0;
cin >> s >> n;
int x[n], y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
int a;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (x[j] > x[i]) {
a = x[i];
x[i] = x[j];
x[j] = a;
a = y[i];
y[i] = y[j];
y[j] = a;
}
}
}
for (int i = 0; i < n; i++) {
if (s > x[i]) {
s = s + y[i];
m++;
}
if (s <= x[i]) {
break;
}
}
if (m == n) {
cout << "YES";
}
if (m != n) {
cout << "NO";
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool comparePair(const pair<int, int>& firstE, const pair<int, int>& secondE) {
return firstE.first < secondE.first;
}
int main() {
pair<int, int> derg;
vector<pair<int, int>> Dragon;
int s, n;
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> derg.first >> derg.second;
Dragon.push_back(derg);
}
sort(Dragon.begin(), Dragon.end(), comparePair);
for (vector<pair<int, int>>::iterator it = Dragon.begin(); it != Dragon.end();
it++) {
if (s > it->first)
s += it->second;
else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
bool compare(pair<int, int> p1, pair<int, int> p2) {
if (p1.first == p2.first)
return (p1.second > p2.second);
else if (p1.first > p2.first)
return (p1.first < p2.first);
}
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (s > v[i].first)
s = s + v[i].second;
else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, cnt = 0;
cin >> s >> n;
int t = n;
vector<pair<int, int> > v;
vector<pair<int, int> >::iterator it;
while (t--) {
int x, y;
cin >> x >> y;
v.push_back(make_pair(x, y));
}
sort(v.begin(), v.end());
for (it = v.begin(); it != v.end(); it++) {
if (s > it->first) {
cnt++;
s += it->second;
}
}
if (n == cnt) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, m, n, arr[10000], brr[10000], i, len1, len2;
cin >> s >> n;
for (m = 0; m < n; m++) {
cin >> arr[m] >> brr[m];
}
for (i = 0; i < n - 1; i++) {
for (m = 0; m < n - 1; m++) {
if (arr[m] > arr[m + 1]) {
len1 = arr[m];
arr[m] = arr[m + 1];
arr[m + 1] = len1;
len2 = brr[m];
brr[m] = brr[m + 1];
brr[m + 1] = len2;
}
}
}
for (m = 0; m < n; m++) {
if (s > arr[m]) {
s = s + brr[m];
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3;
pair<int, int> a[N];
int main() {
int s, n;
scanf("%d %d", &s, &n);
for (int i = 0; i < n; ++i) {
scanf("%d %d", &a[i].first, &a[i].second);
}
sort(a, a + n);
for (int i = 0; i < n; ++i) {
if (s > a[i].first)
s += a[i].second;
else {
puts("NO");
return 0;
}
}
puts("YES");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Strength {
int x, y;
};
bool cmt(struct Strength a, struct Strength b) { return a.x < b.x; }
int main() {
int s, n, i;
cin >> s >> n;
struct Strength a[n];
for (i = 0; i < n; i++) {
cin >> a[i].x >> a[i].y;
}
sort(a, a + n, cmt);
i = 0;
while (i < n && s > a[i].x) {
s += a[i].y;
i++;
}
if (i == n)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 123;
const int MINN = 1e3 + 123;
const int mod = 1e9 + 7;
const int INF = 1e9 + 1;
pair<int, int> a[MINN];
bool cmp(pair<int, int> a, pair<int, int> b) {
if (a.first < b.first) return 1;
if (a.first == b.first)
if (a.second > b.second) return 1;
return 0;
}
int main() {
int n, sum;
cin >> sum >> n;
for (int i = 1; i <= n; i++) scanf("%d%d", &a[i].first, &a[i].second);
sort(a + 1, a + n + 1, &cmp);
for (int i = 1; i <= n; i++) {
if (sum <= a[i].first) {
cout << "NO";
return 0;
}
sum += a[i].second;
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> k >> n;
vector<pair<int, int> > v;
while (n--) {
int val1, val2;
cin >> val1 >> val2;
v.push_back(make_pair(val1, val2));
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
if (k <= v[i].first) {
cout << "NO\n";
return 0;
}
k += v[i].second;
}
cout << "YES\n";
}
|
#include <bits/stdc++.h>
const int N = 2e5 + 3;
using namespace std;
vector<int> v;
int main() {
int s, n, k, b;
cin >> s >> n;
int a[n][2];
for (int i = 0; i <= n - 1; i++) {
cin >> a[i][0] >> a[i][1];
}
for (int i = 0; i <= n - 1; i++) {
b = -100000;
k = -1;
for (int j = 0; j <= n - 1; j++)
if (s > a[j][0]) {
if (a[j][1] > b) {
b = a[j][1];
k = j;
}
}
if (k == -1) {
cout << "NO" << endl;
return 0;
} else {
s += a[k][1];
a[k][0] = 100000;
}
if (i == n - 1) {
cout << "YES" << endl;
return 0;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(int a, int b) { return a > b; }
bool isvowel(char c) {
return (c == 'a' || c == 'A' || c == 'e' || c == 'E' || c == 'i' ||
c == 'I' || c == 'o' || c == 'O' || c == 'u' || c == 'U');
}
int a[1001];
void swaps(int *a, int *b) {
int temp = *a;
*a = *b;
*b = temp;
}
void f(int size) {
if (size == 1) return;
sort(a, a + size - 1);
swaps(&a[size - 1], &a[size - 2]);
f(size - 1);
}
int main() {
int n, s;
scanf("%d %d", &s, &n);
;
std::vector<pair<int, int> > a;
int x, y;
for (int i = 0; i < n; ++i) {
scanf("%d %d", &x, &y);
;
a.push_back(make_pair(x, y));
}
long long int ans = (long long int)s;
sort(a.begin(), a.end());
for (int i = 0; i < n; ++i) {
if (ans > a[i].first) {
ans += a[i].second;
} else {
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e6 + 5;
long long n, m, flag, flag1, ma, mi, ans, sum, T, k;
long long a[MAXN], b[MAXN];
char c[MAXN];
int mapp[5001][5001];
string str, str1, str2;
set<char> ss;
vector<char> v;
bool judge(int x) {
if (x == 2 || x == 3) return false;
for (int i = 2; i <= sqrt(x); i++) {
if (x % i == 0) return true;
}
return false;
}
struct node {
int a, b;
} dro[1001];
bool cmp(node x, node y) {
if (x.a != y.a)
return x.a < y.a;
else
return x.b > y.b;
}
int main() {
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> dro[i].a >> dro[i].b;
}
sort(dro, dro + m, cmp);
for (int i = 0; i < m; i++) {
if (n <= dro[i].a) {
cout << "NO" << endl;
return 0;
} else
n += dro[i].b;
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long s, n, x[1001], y[1001];
cin >> s >> n;
for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (x[i] > x[j]) {
swap(x[i], x[j]);
swap(y[i], y[j]);
}
}
}
for (int i = 0; i < n; i++) {
if (s > x[i])
s += y[i];
else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1009;
int s, n;
pair<int, int> p[N];
int cnt;
int main() {
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
if (s > p[i].first) {
s += p[i].second;
cnt++;
}
}
if (cnt == n)
cout << "YES" << endl;
else
cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int second, n, i, j, k;
pair<int, int> p[1000];
int main() {
cin.ios_base::sync_with_stdio();
cout.ios_base::sync_with_stdio();
scanf("%d%d", &second, &n);
for ((i) = 0; (i) < (int)(n); (i)++) scanf("%d%d", &p[i].first, &p[i].second);
sort(p, p + n);
bool ans = 1;
int t = second;
for ((i) = 0; (i) < (int)(n); (i)++)
if (t <= p[i].first) {
ans = 0;
break;
} else
t += p[i].second;
if (ans)
puts("YES");
else {
for ((i) = 0; (i) < (int)(n); (i)++) swap(p[i].first, p[i].second);
sort(p, p + n);
t = second;
ans = 1;
for ((i) = 0; (i) < (int)(n); (i)++)
if (t <= p[i].second) {
ans = 0;
break;
} else
t += p[i].first;
if (ans)
puts("YES");
else
puts("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct v {
int c;
int d;
} m;
bool cmp(m v, m w) { return v.c < w.c; }
int main() {
int b, c, v, w, s, n, sum = 0, ans = 0;
m *a;
cin >> s >> n;
a = new m[n];
pair<int, int> p;
for (int i = 0; i < n; i++) {
cin >> a[i].c >> a[i].d;
}
sort(a, a + n, cmp);
for (int i = 0; i < n; i++) {
if (s <= a[i].c) {
cout << "NO" << endl;
return 0;
} else
s += a[i].d;
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, i, j;
cin >> s >> n;
int ara[n][2];
for (i = 0; i < n; i++) {
for (j = 0; j < 2; j++) {
cin >> ara[i][j];
}
}
int c = 0;
for (i = 0; i < n; i++) {
int p = 0;
for (j = 0; j < n; j++) {
if (ara[j][0] < s) {
s += ara[j][1];
ara[j][0] = 100000000;
ara[j][1] = 0;
p = 1;
c++;
}
}
if (c == n) {
break;
}
}
if (c == n) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
int d[n][2];
for (int i = 0; i < n; i++) {
cin >> d[i][0];
cin >> d[i][1];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (s > d[j][0] && d[j][0] != -1) {
d[j][0] = -1;
s += d[j][1];
break;
}
}
}
for (int i = 0; i < n; i++) {
if (d[i][0] != -1) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
pair<int, int> d[n];
bool ans = true;
for (int i = 0; i < n; ++i) {
cin >> d[i].first >> d[i].second;
}
sort(d, d + n);
for (int i = 0; i < n; ++i) {
if (s <= d[i].first) {
cout << "NO";
return 0;
}
s += d[i].second;
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, s;
cin >> s >> n;
vector<pair<long long, long long>> v(n);
for (long long int i = 0; i < n; i++) {
cin >> v[i].first >> v[i].second;
}
sort(v.begin(), v.end());
for (long long int i = 0; i < n; i++) {
if (s > v[i].first) {
s += v[i].second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct S {
long long x, y;
} ss[100010];
bool cmp(S a, S b) { return a.x < b.x; }
int main() {
long long s, n;
while (cin >> s >> n) {
for (int i = 1; i <= n; i++) cin >> ss[i].x >> ss[i].y;
sort(ss + 1, ss + 1 + n, cmp);
bool f = 1;
for (int i = 1; i <= n; i++) {
if (s <= ss[i].x) {
f = 0;
break;
} else {
s += ss[i].y;
}
}
if (f)
puts("YES");
else
puts("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, n, m, b[111111], c[111111], x;
int main() {
pair<long long, long long> k[111111];
cin >> x >> a;
for (int i = 1; i <= a; i++) {
cin >> k[i].first >> k[i].second;
}
sort(k + 1, k + a + 1);
for (int i = 1; i <= a; i++) {
if (x > k[i].first) {
x += k[i].second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
long int s, n, a[1010], b[1010], i, j, p, f;
scanf("%ld%ld", &s, &n);
for (i = 0; i < n; i++) {
scanf("%ld%ld", &a[i], &b[i]);
}
for (i = n - 1; i > 0; i--) {
for (j = 0; j < i; j++) {
if (a[i] < a[j]) {
p = a[i];
a[i] = a[j];
a[j] = p;
p = b[i];
b[i] = b[j];
b[j] = p;
}
}
}
for (i = 0, f = 0; i < n; i++) {
if (s > a[i]) {
s = s + b[i];
} else {
f = 1;
break;
}
}
if (f == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
bool www = true;
long long n, s, a, b, d = -1, p = 0, q = 0, j;
cin >> n >> s;
vector<pair<long long, long long>> v;
for (int i = 0; i < s; i++) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}
for (int i = 0; i < v.size(); i++) {
swap(v[i].first, v[i].second);
}
sort(v.rbegin(), v.rend());
for (int i = 0; i < v.size(); i++) {
swap(v[i].first, v[i].second);
}
for (j = 0; j < s - 1; j++) {
d == -1;
for (int i = 0; i < v.size(); i++) {
if (n <= v[i].first) {
d = -1;
}
if (n > v[i].first) {
d = v[i].second;
p = i;
break;
}
}
if (d == -1) {
www = false;
break;
continue;
}
v.erase(v.begin() + p);
n = n + d;
}
if (n <= v[0].first) {
www = false;
}
if (www == true) cout << "YES" << endl;
if (www == false) cout << "NO" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int MOD = 1e9 + 7;
long long int gcd(long long int a, long long int b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long int prime(long long int n) {
for (long long int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) {
return 0;
}
}
return 1;
}
void solver() {
long long int s, n;
cin >> s >> n;
vector<pair<long long int, long long int>> v;
for (long long int i = 0; i < n; i++) {
long long int x, y;
cin >> x >> y;
v.push_back({x, y});
}
sort(v.begin(), v.end());
long long int flag = 0;
for (long long int i = 0; i < n; i++) {
if (s > v[i].first) {
s += v[i].second;
} else {
flag = 1;
break;
}
}
if (flag == 0) {
cout << "YES\n";
} else {
cout << "NO\n";
}
}
int main() {
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
long long int t = 1;
while (t--) {
solver();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, e, c, x, s;
int z, v, n, m, a, b, j, q[999];
pair<int, int> d[1005];
int main() {
cin >> s >> x;
for (i = 0; i < x; i++) {
cin >> d[i].first >> d[i].second;
}
sort(d, d + x);
for (i = 0; i < x; i++) {
if (s > d[i].first)
s = s + d[i].second;
else {
cout << "NO";
return 0;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
struct a {
long long yi, xi;
};
bool compare(a x1, a x2) { return x1.xi < x2.xi; }
int main() {
int s, n;
cin >> s >> n;
vector<a> dragon(n);
for (int i = 0; i < n; i++) {
cin >> dragon[i].xi >> dragon[i].yi;
}
sort(dragon.begin(), dragon.end(), compare);
for (int i = 0; i < dragon.size(); i++) {
if (s > dragon[i].xi) {
s += dragon[i].yi;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int s, n, i;
bool hey;
pair<int, int> k[1000];
int main() {
cin >> s >> n;
for (i = 0; i < n; i++) cin >> k[i].first >> k[i].second;
sort(k, k + n);
hey = 0;
for (i = 0; i < n; i++) {
if (k[i].first < s) {
s += k[i].second;
} else {
hey = 1;
break;
}
}
if (hey == 1)
cout << "NO";
else
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, n;
cin >> k >> n;
std::vector<pair<int, int>> V;
for (int i = 0; i < n; i++) {
int q, w;
cin >> q >> w;
V.push_back({q, w});
}
sort(V.begin(), V.end());
for (int i = 0; i < n; i++) {
if (k > V[i].first) {
k += V[i].second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int s, n, a, b;
vector<pair<int, int>> v;
int main() {
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
if (s <= v[i].first) {
cout << "NO";
return 0;
} else {
s += v[i].second;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
long long ans, res, flag;
long double cem;
int main() {
int second, n;
cin >> second >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
for (int i = 0; i < v.size(); i++) {
int bir = v[i].first, iki = v[i].second;
if (second > bir) {
second += iki;
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n, res = 1;
scanf("%d %d", &s, &n);
int arr[n][2];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2; j++) {
scanf("%d", &arr[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j][0] > arr[j + 1][0]) {
swap(arr[j][0], arr[j + 1][0]);
swap(arr[j][1], arr[j + 1][1]);
}
}
}
for (int i = 0; i < n; i++) {
if (s > arr[i][0]) {
s = s + arr[i][1];
} else {
res = 0;
break;
}
}
if (res == 0) {
printf("NO\n");
} else if (res == 1) {
printf("YES\n");
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int kirito, dragnum, flag = 0, temp;
scanf("%d %d", &kirito, &dragnum);
int i, j, dragon[dragnum + 1], bonus[dragnum + 1];
for (i = 0; i < dragnum; i++) {
scanf("%d %d", &dragon[i], &bonus[i]);
}
for (i = 0; i < dragnum; i++) {
for (j = i + 1; j < dragnum; j++) {
if (dragon[i] > dragon[j]) {
temp = dragon[i];
dragon[i] = dragon[j];
dragon[j] = temp;
temp = bonus[i];
bonus[i] = bonus[j];
bonus[j] = temp;
}
}
}
for (i = 0; i < dragnum; i++) {
for (j = i + 1; j < dragnum; j++) {
if (dragon[i] == dragon[j] && bonus[i] < bonus[j]) {
temp = bonus[i];
bonus[i] = bonus[j];
bonus[j] = temp;
}
}
}
for (i = 0; i < dragnum; i++) {
if (kirito > dragon[i]) {
kirito += bonus[i];
} else {
flag = 1;
break;
}
}
if (flag == 0) {
printf("YES\n");
} else {
printf("NO\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, s, a, b;
cin >> s >> n;
multimap<int, int> m;
for (int i = 0; i < n; i++) {
cin >> a >> b;
m.insert(make_pair(a, b));
}
for (multimap<int, int>::iterator a = m.begin(); a != m.end(); a++) {
if (s > a->first)
s += a->second;
else if (s <= a->first) {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int ki, n;
scanf("%d", &ki);
scanf("%d", &n);
int dragf[2000];
int aume[2000];
bool ban = true;
for (int i = 0; i < n; i++) {
scanf("%d", &dragf[i]);
scanf("%d", &aume[i]);
}
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - 1; j++) {
if (dragf[j] > dragf[j + 1]) {
int tmp = dragf[j];
int tmp2 = aume[j];
dragf[j] = dragf[j + 1];
dragf[j + 1] = tmp;
aume[j] = aume[j + 1];
aume[j + 1] = tmp2;
}
}
}
for (int i = 0; i < n; i++) {
if (dragf[i] >= ki) {
ban = false;
}
ki = ki + aume[i];
}
if (ban == true) {
printf("YES");
} else {
printf("NO");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Dragon {
int power;
int bonus;
};
int main() {
int power, count;
cin >> power >> count;
vector<Dragon> dragons;
dragons.resize(count);
for (int i = 0; i < count; i++) {
cin >> dragons[i].power >> dragons[i].bonus;
}
while (!dragons.empty()) {
bool w = false;
for (int i = 0; i < dragons.size(); i++) {
if (power > dragons[i].power) {
power += dragons[i].bonus;
dragons.erase(dragons.begin() + i);
w = true;
}
}
if (!w) {
cout << "NO";
exit(0);
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
pair<int, int> p[n];
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p, p + n);
for (int j = 0; j < n; j++) {
if (s > p[j].first) {
s = s + p[j].second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int>> a;
int s, n, i, x, y, d = 0;
cin >> s >> n;
for (i = 0; i < n; i++) {
cin >> x >> y;
a.push_back(make_pair(x, y));
}
sort(a.begin(), a.end());
for (i = 0; i < n; i++)
if (s > a[i].first)
s += a[i].second;
else {
d = 1;
break;
}
if (d == 1)
cout << "NO";
else
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int s, n;
cin >> s >> n;
vector<pair<int, int> > v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
for (auto u : v) {
if (s > u.first) {
s += u.second;
} else {
cout << "NO" << endl;
return 0;
}
}
cout << "YES" << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 7;
int main() {
int s, n;
cin >> s >> n;
vector<pair<int, int>> dra;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
dra.push_back(make_pair(a, b));
}
sort(dra.begin(), dra.end());
for (int i = 0; i < n; ++i) {
if (dra[i].first < s) {
s += dra[i].second;
} else {
cout << "NO";
return 0;
}
}
cout << "YES";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, s, k1, k2, f;
vector<pair<int, int> > dragon;
int main() {
cin >> s >> n;
for (int i = 0; i < n; i++) {
cin >> k1 >> k2;
dragon.push_back(make_pair(k1, k2));
}
sort(dragon.begin(), dragon.end());
for (int i = 0; i < n; i++) {
if (s <= dragon[i].first) {
f = 1;
break;
}
s += dragon[i].second;
}
if (f == 0)
cout << "YES";
else
cout << "NO";
return 0;
}
|
#include <bits/stdc++.h>
int x[1001];
int y[1001];
bool isf[1001];
int main() {
int s, n;
scanf("%d %d", &s, &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d", &x[i], &y[i]);
}
memset(isf, false, sizeof(bool) * 1001);
int t = s;
while (1) {
int k = 0, m = -1;
bool isl = false;
for (int i = 1; i <= n; i++) {
if (!isf[i]) {
isl = true;
}
if (!isf[i] && x[i] < t) {
if (m < y[i]) {
m = y[i];
k = i;
}
}
}
if (k == 0 && isl) {
printf("NO\n");
break;
}
if (!isl) {
printf("YES\n");
break;
} else {
t += m;
isf[k] = true;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct Node {
int xi;
int yi;
};
int main() {
int s, n;
scanf("%d%d", &s, &n);
struct Node Q[n];
int i;
for (i = 0; i < n; i++) {
scanf("%d", &Q[i].xi);
scanf("%d", &Q[i].yi);
}
for (i = 0; i < n; i++) {
for (int j = 0; j < n - 1; j++) {
if (Q[j].xi > Q[j + 1].xi) {
int t_xi, t_yi;
t_xi = Q[j].xi;
t_yi = Q[j].yi;
Q[j].xi = Q[j + 1].xi;
Q[j].yi = Q[j + 1].yi;
Q[j + 1].xi = t_xi;
Q[j + 1].yi = t_yi;
}
}
}
for (i = 0; i < n; i++) {
if (Q[i].xi < s) {
s += Q[i].yi;
} else
break;
}
if (i == n) {
printf("YES");
} else
printf("NO");
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int MAX = 200005;
int bipow(int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
bool isPrime(int x) {
if (x == 1)
return 0;
else if (x == 2 || x == 3)
return 1;
if (x % 2 == 0 || x % 3 == 0) return 0;
for (int i = 5; i * i <= x; i += 6) {
if (x % i == 0 || x % (i + 2) == 0) return 0;
}
return 1;
}
void solve() {
int s, n;
cin >> s >> n;
vector<pair<int, int> > d(n);
for (int i = 0; i < n; i++) cin >> d[i].first >> d[i].second;
sort(d.begin(), d.end());
for (int i = 0; i < n; i++) {
if (s <= d[i].first) {
cout << "NO" << endl;
return;
} else {
s += d[i].second;
}
}
cout << "YES" << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
while (tc--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
vector<pair<int, int> > v;
long long s, n;
cin >> s >> n;
for (int i = 1; i <= n; i++) {
long long a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
long long siz = v.size();
int f = 0;
for (int i = 0; i < siz; i++) {
if (s > v[i].first) {
s += v[i].second;
} else {
f = 1;
break;
}
}
if (f == 0)
cout << "YES\n";
else
cout << "NO\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int s, n, x, y;
cin >> s >> n;
vector<pair<int, int>> dragons;
for (int i = 0; i < n; i++) {
cin >> x >> y;
dragons.push_back({x, y});
}
sort(dragons.begin(), dragons.end());
bool can = 1;
for (auto dragon : dragons) {
tie(x, y) = dragon;
if (s <= x) {
can = 0;
break;
}
s += y;
}
cout << (can ? "YES" : "NO");
}
|
#include <bits/stdc++.h>
using namespace std;
typedef struct rong {
int chien, cong;
};
bool sapxep(rong a, rong b) {
if (a.chien < b.chien) return 1;
return 0;
}
int main() {
long long s, n;
cin >> s >> n;
rong a[10001];
long long chien[10001];
for (int i = 0; i < n; i++) {
cin >> a[i].chien >> a[i].cong;
}
sort(a, a + n, sapxep);
int mark = 1;
for (int i = 0; i < n; i++) {
if (i == 0) {
chien[i] = s;
}
if (chien[i] > a[i].chien) {
chien[i + 1] = chien[i] + a[i].cong;
} else {
mark = 0;
break;
}
}
if (mark == 0)
cout << "NO";
else
cout << "YES";
}
|
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int m, long long int n) {
if (n == 0) return m;
return gcd(n, m % n);
}
long long int fastpow(long long int a, long long int b, long long int m) {
long long int r = 1;
while (b > 0) {
if (b % 2 == 1) r = (r * a) % m;
b = b >> 1;
a = (a * a) % m;
}
return r;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n, s, i, var, flag = 1;
vector<int> vec1, vec2;
vector<pair<int, int> > vec;
pair<int, int> mypair;
cin >> s >> n;
for (i = 0; i < n; i++) {
cin >> var;
vec1.push_back(var);
cin >> var;
vec2.push_back(var);
}
for (i = 0; i < n; i++) {
mypair.first = vec1[i];
mypair.second = vec2[i];
vec.push_back(mypair);
}
sort(vec.begin(), vec.end());
for (i = 0; i < n; i++) {
if (vec[i].first >= s) {
flag = 0;
break;
} else {
s = s + vec[i].second;
}
}
if (flag == 0)
cout << "NO\n";
else
cout << "YES\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int s, n;
cin >> s >> n;
pair<int, int> arr[10000];
for (int i = 0; i < n; i++) cin >> arr[i].first >> arr[i].second;
sort(arr, arr + n);
int sum = s;
bool flag = false;
for (int i = 0; i < n; i++) {
if (arr[i].first >= sum) {
flag = true;
break;
}
sum += arr[i].second;
}
if (flag)
cout << "NO" << endl;
else
cout << "YES" << endl;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.