# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119081 | Bruteforceman | Cambridge (info1cup18_cambridge) | C++11 | 2067 ms | 1984 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
typedef pair <int, int> pii;
int t[100010], d[100010];
int opt[100010];
int query(int x, int y) {
vector <pii> v;
for(int i = x; i <= y; i++) {
v.emplace_back(d[i], t[i]);
}
sort(v.begin(), v.end());
long long sum = 0;
for(int i = 0; i < v.size(); i++) {
sum += v[i].second;
if(sum >= v[i].first) {
return false;
}
}
return true;
}
int main(int argc, char const *argv[])
{
int n, m;
scanf("%d %d", &n, &m);
for(int i = 1; i <= n; i++) {
scanf("%d %d", &t[i], &d[i]);
}
int cur = n;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |