Submission #205163

#	Time	Username	Problem	Language	Result	Execution time	Memory
205163		ruler	Hotel (CEOI11_hot)	C++14	100 / 100	1503 ms	48200 KiB

hot

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

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

////////////////////////////////////////////////////////////////////

const int N = 1e5 + 3;

multiset<pii> R;
vector<pii> O;
vector<int> T;

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);	
	
	int n, m, o; cin >> n >> m >> o;
	for (int i = 0; i < n; i++) {
		int c, p; cin >> c >> p;
		R.insert(make_pair(p, c));
	}
	for (int i = 0; i < m; i++) {
		int v, d; cin >> v >> d;
		O.push_back(make_pair(v, d));
	}
	sort(all(O)), reverse(all(O));
	for (pii p : O) {
		auto it = R.lower_bound(make_pair(p.second, 0));
		if (it != R.end()) T.push_back(max(0, p.first - it->second)), R.erase(it);
	}
	sort(all(T)), reverse(all(T));
	ll res = 0;
	for (int i = 0; i < sz(T) && i < o; i++) res += T[i];
	cout << res << endl;

	return 0;
}

• 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