제출 #773087

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
773087		NK_	Hotel (CEOI11_hot)	C++17	100 / 100	585 ms	52984 KiB

hot

// Success consists of going from failure to failure without loss of enthusiasm
#include <bits/stdc++.h>

using namespace std;

#define nl '\n'
#define f first
#define s second
#define mp make_pair
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)


using ll = long long;
using pi = pair<int, int>;
template<class T> using V = vector<T>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	
	int N, M, O; cin >> N >> M >> O;

	V<pi> A(N); for(auto& x : A) cin >> x.f >> x.s;
	V<pi> B(M); for(auto& x : B) cin >> x.f >> x.s;

	sort(all(A));
	sort(rall(B));

	set<pi> S; for(int i = 0; i < N; i++) S.insert(mp(A[i].s, i));

	V<int> P;
	for(int i = 0; i < M; i++) {
		auto it = S.lower_bound(mp(B[i].s, -1));
		if (it == end(S)) continue;
		int j = (*it).s;
		// cout << i << " " << j << endl;
		P.push_back(B[i].f - A[j].f);
		S.erase(it);
	}	

	sort(rall(P));

	ll ans = 0;
	for(int i = 0; i < min(O, sz(P)); i++) ans += max(0, P[i]);
	cout << ans << nl;

    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