제출 #1214077

#제출 시각아이디문제언어결과실행 시간메모리
1214077justExhibition (JOI19_ho_t2)C++20
0 / 100
0 ms324 KiB
#include "bits/stdc++.h"
using namespace std;

#define vec vector
#define int long long
#define all(x) (x).begin(), (x).end()

const int mod = 998244353;
const int inf = LLONG_MAX;

using pii = pair<int, int>;

signed main() {
	int n, m;
	cin >> n >> m;

	vec<pii> pictures(n);
	for (auto &[s, v] : pictures)
		cin >> s >> v;
	sort(pictures.begin(), pictures.end(), [](const pii &a, const pii &b) {
		return a.second < b.second ||
			   (a.second == b.second && a.first < b.first);
	});

	vec<int> frames(m);
	for (int &x : frames)
		cin >> x;
	sort(all(frames));

	int i = 0, j = 0, ans = 0;
	while (i < n && j < m) {
		if (frames[j] >= pictures[i].first) {
			ans++;
			i++;
			j++;
		} else {
			j++;
		}
	}

	cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...