# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294377 | peti1234 | Teams (IOI15_teams) | C++17 | 0 ms | 0 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;
long long n, pos, sum;
vector<pair<int, int> > sz;
vector<int> kerd;
bool can(int m, int[] a) {
pos=0, sum=0;
for (int i=0; i<m; i++) sum+=a[i];
if (sum>n) return 0;
for (int i=0; i<m; i++) for (int j=0; j<a[i]; j++) kerd.push_back(a[i]);
sort(kerd.begin(), kerd.end());
for (int i=0; i<n; i++) {
if (pos<sum && sz[i].second<=kerd[pos] && kerd[pos]<=sz[i].first) pos++;
}
return (pos==sum);
}
void init(int p, int a[], int b[]) {
n=p;
for (int i=0; i<n; i++) sz.push_back(b[i], a[i]);
sort(sz.begin(), sz.end());
}