Submission #1233650

#TimeUsernameProblemLanguageResultExecution timeMemory
1233650antromancapExhibition (JOI19_ho_t2)C++20
100 / 100
30 ms1608 KiB
#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 1;
int n, m, x[N], C[N];
pair<int, int> a[N];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i].second >> a[i].first;
	sort(a + 1, a + n + 1);
	for (int i = 1; i <= m; i++) cin >> C[i];
	sort(C + 1, C + m + 1, greater<int>());
	int res = 1;
	for (int i = n; i; i--)
		if (res <= m && a[i].second <= C[res]) res++;
	cout << res - 1;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...