제출 #384286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
384286		Drew_	Exhibition (JOI19_ho_t2)	C++14	100 / 100	63 ms	4588 KiB

joi2019_ho_t2

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define ii pair<int, int>
#define f1 first
#define s2 second

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

	int n, m;
	cin >> n >> m;

	vector<ii> pict(n);
	vector<int> frame(m);

	for (ii &x : pict)
		cin >> x.s2 >> x.f1;
	for (int &x : frame)
		cin >> x;

	sort(pict.begin(), pict.end(), greater<ii>());
	sort(frame.begin(), frame.end(), greater<int>());

	int res = 0, idx = 0;
	for (int x : frame)
	{
		while (idx < n && pict[idx].s2 > x)
			idx++;
		if (idx < n)
			res++, idx++;
	}
	cout << res << '\n';

	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 40 / 40
• Subtask 3: 50 / 50