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;
#define int long long
const int MAX_N = 1000010;
int32_t main()
{
int n, m, ans = 0;
cin >> n >> m;
pair<int, int> a[n + 1];
for(int i = 1; i <= n; i++)
{
cin >> a[i].first >> a[i].second;
swap(a[i].first, a[i].second);
}
int b[m + 1];
for(int i = 1; i <= m; i++)
{
cin >> b[i];
}
sort(a + 1, a + n + 1);
sort(b + 1, b + m + 1);
reverse(a + 1, a + n + 1);
reverse(b + 1, b + m + 1);
int j = 1;
for(int i = 1; i <= m; i++)
{
while(j <= n and a[j].second > b[i])
{
j++;
}
ans += (j <= n ? 1 : 0);
j++;
}
cout << ans;
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... |