제출 #1126432

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1126432		dubabuba	Exhibition (JOI19_ho_t2)	C++20	100 / 100	308 ms	25680 KiB

joi2019_ho_t2

#include <bits/stdc++.h>
using namespace std;

#define int long long
typedef pair<int, int> pii;
#define ff first
#define ss second
#define MP make_pair

const int inf = 1e18 + 10;
const int mxn = 2e5 + 10;
int s[mxn], v[mxn], c[mxn];
int val[mxn];
int n, m, k = 1;

int32_t main() {
	cin >> n >> m;
	map<int, int> mp;

	for(int i = 1; i <= n; i++) {
		cin >> s[i] >> v[i];
		mp[s[i]];
	}

	for(int i = 1; i <= m; i++) {
		cin >> c[i];
		mp[c[i]];
	}


	priority_queue<pii> pq;
	multiset<pii> ms;

	for(int i = 1; i <= n; i++) {
		pq.push(MP(s[i], v[i]));
		ms.insert(MP(v[i], s[i]));
	}

	for(int i = 1; i <= m; i++) {
		pq.push(MP(c[i], inf));
	}

	int ans = 0;
	while(pq.size()) {
		if(ms.size() == 0) break;
		int SIZE = pq.top().ff;
		int val = pq.top().ss;
		pq.pop();

		if(val < inf) {
			auto it = ms.find(MP(val, SIZE));
			if(it == ms.end()) continue;
			ms.erase(it);
		}
		else {
			auto it = ms.end();
			it--;
			ms.erase(it);
			ans++;
		}
	}

	cout << ans << endl;
	return 0;
}

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