제출 #110406

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
110406		thiago4532	Exhibition (JOI19_ho_t2)	C++17	100 / 100	206 ms	2812 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
#define int int64_t
#define ff first
#define ss second

using namespace std;
const int maxn = 1e5 + 10;
pair<int, int> a[maxn];
int b[maxn];

int32_t main() {
	int n, m;
	cin >> n >> m;
	for(int i=1;i<=n;i++)
		cin >> a[i].ss >> a[i].ff;
	for(int i=1;i<=m;i++)
		cin >> b[i];
	sort(a+1, a+n+1);
	sort(b+1, b+m+1, greater<int>());

	int guy = n, ans=0;
	for(int i=1;i<=m;i++){
		while(guy >= 1 && a[guy].ss > b[i]) guy--;
		if(guy < 1) break;

		ans++;
		guy--;
	}
	cout << ans << "\n";
	return 0;
}

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