# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305835 | T0p_ | Exhibition (JOI19_ho_t2) | C++14 | 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;
struct picture
{
int s, v;
bool operator < (const picture & o) const
{
return (v == o.v) ? s < o.s : v < o.v;
}
};
pair<int, int> p[100100];
int f[100100];
int main()
{
int n, m;
scanf(" %d %d",&n,&m);
for(int i=1 ; i<=n ; i++)
scanf(" %d %d",&p[i].s,&p[i].v);
for(int i=1 ; i<=m ; i++)
scanf(" %d",&f[i]);
sort(p+1, p+n+1);
sort(f+1, f+m+1);
int i = n, j = m, ans = 0;
while(i >= 1 && j >= 1)
{
if(p[i].s <= f[j])
{
j--;
ans++;
}
i--;
}
printf("%d\n",ans);
return 0;
}