# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225991 | Ruxandra985 | Exhibition (JOI19_ho_t2) | C++14 | 6 ms | 768 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>
#define DIMN 100010
using namespace std;
int w[DIMN] , f[DIMN];
pair <int,pair <int,int> > v[DIMN];
pair <int , int> p[DIMN];
int n , m;
int check (int nr){
int i , p2;
memset (f , 0 , sizeof(f));
for (i = 1 ; i <= nr ; i++){
f[-p[i].second] = 1;
}
p2 = m;
for (i = n ; i ; i--){
if (f[i]){
if (w[p2] < v[i].second.first)
return 0;
p2--;
}
}
return 1;
}
int main()
{
FILE *fin = stdin;
FILE *fout = stdout;
int i , st , dr , mid , ed = 0;
fscanf (fin,"%d%d",&n,&m);
for (i = 1 ; i <= n ; i++){
fscanf (fin,"%d%d",&v[i].second.first,&v[i].first);
v[i].second.second = i;
}
for (i = 1 ; i <= m ; i++)
fscanf (fin,"%d",&w[i]);
sort (v + 1 , v + n + 1);
sort (w + 1 , w + m + 1);
for (i = 1 ; i <= n ; i++)
p[i] = make_pair(v[i].second.first , -i);
sort (p + 1 , p + n + 1);
st = 1;
dr = min (n , m);
while (st <= dr){
mid = (st + dr) / 2;
if (check(mid))
st = mid + 1;
else dr = mid - 1;
}
fprintf (fout,"%d",dr);
return 0;
}
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... |