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 int int64_t
#define ff first
#define ss second
using namespace std;
const int maxn = 1e5 + 10;
pair<int, int> a[maxn];
int b[maxn];
int32_t main() {
int n, m;
cin >> n >> m;
for(int i=1;i<=n;i++)
cin >> a[i].ss >> a[i].ff;
for(int i=1;i<=m;i++)
cin >> b[i];
sort(a+1, a+n+1);
sort(b+1, b+m+1, greater<int>());
int guy = n, ans=0;
for(int i=1;i<=m;i++){
while(guy >= 1 && a[guy].ss > b[i]) guy--;
if(guy < 1) break;
ans++;
guy--;
}
cout << ans << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |