# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412954 | ScarletS | 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;
const int N = 5e5+7;
int n;
array<int,2> a[N];
bool cmp(array<int,2>& x, array<int,2> &y)
{
return x[1] < y[1];
}
void init(int N, int A[], int B[])
{
n=N;
for (int i=0;i<n;++i)
a[i]={A[i],B[i]};
sort(a,a+n);
}
bool can(int m, int k[])
{
sort(k,k+m);
int c=0, x=0;
for (int i=0;i<n&&c<m;++i)
if (l[i]<=k[c]&&k[c]<=r[i])
if (++x==k[c])
x=0,++c;
return c==m;
}