Submission #547099

#TimeUsernameProblemLanguageResultExecution timeMemory
547099HanksburgerExhibition (JOI19_ho_t2)C++17
100 / 100
52 ms4416 KiB
#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[100005];
int b[100005];
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m, ans=0;
	cin >> n >> m;
	for (int i=1; i<=n; i++)
		cin >> a[i].second >> a[i].first;
	for (int i=1; i<=m; i++)
		cin >> b[i];
	sort(a+1, a+n+1);
	sort(b+1, b+m+1);
	for (int i=n; i>=1 && ans<m; i--)
		if (a[i].second<=b[m-ans])
			ans++;
	cout << ans;
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...