Submission #385244

#	Time	Username	Problem	Language	Result	Execution time	Memory
385244		ritul_kr_singh	Hotel (CEOI11_hot)	C++17	20 / 100	1081 ms	43736 KiB

hot

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'
 
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int n, m, o; cin >> n >> m >> o;
	array<int, 2> offers[m], room;
	multiset<array<int, 2>> rooms;
	for(int i=0; i<n; ++i){
		cin >> room[1] >> room[0];
		rooms.insert(room);
	}
	for(auto &i : offers) cin >> i[0] >> i[1], i[1] = -i[1];
	sort(offers, offers+m, greater<>());
	vector<int> pos;
 
	for(auto &i : offers){
		auto f = rooms.lower_bound({-i[1], 0});
		if(f != rooms.end()){
			pos.push_back(i[0] - (*f)[1]);
			rooms.erase(f);
		}
	}
 
	sort(pos.begin(), pos.end(), greater<>());
	cout << accumulate(pos.begin(), pos.begin()+o, 0LL);
 
 
}

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