Submission #743280

#	Time	Username	Problem	Language	Result	Execution time	Memory
743280		Dan4Life	Hotel (CEOI11_hot)	C++17	100 / 100	1656 ms	43748 KiB

hot

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = (int)5e5+10;
int n, m, k, x, y;
array<int,2> a[mxN];

int32_t main(){
	cin >> n >> m >> k; multiset<pair<int,int>> Ms; 
	while(n--) cin >> x >> y, Ms.insert({y,x});
	for(int i = 0; i < m; i++) cin >> a[i][0] >> a[i][1];
	priority_queue<int> Q; int ans = 0; sort(a,a+m);
	for(int i = m-1; i >= 0; i--){
		auto itr=Ms.lower_bound({a[i][1],0});
		if(itr!=end(Ms) and itr->second < a[i][0])
			Q.push(a[i][0]-itr->second), Ms.erase(itr);
	}
	while(k-- and size(Q)) ans+=max(0ll,Q.top()), Q.pop();
	cout << ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10