제출 #901664

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
901664		MilosMilutinovic	Hotel (CEOI11_hot)	C++14	40 / 100	4102 ms	24500 KiB

hot

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = array<int, 2>;
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
const int MAX = 1505;

int n, m, o;

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m >> o;
	vector<pi> c(n);
	for (int i = 0; i < n; i++)
		cin >> c[i][0] >> c[i][1];
	sort(all(c));
	vector<pi> d(m);
	for (int i = 0; i < m; i++)
		cin >> d[i][0] >> d[i][1];
	sort(all(d));
	vector<bool> a(n), b(m);
	lint res = 0;
	while (o--) {
		int mx = (int) -1e9;
		int x = 0, y = 0;
		for (int i = 0; i < n; i++) {
			if (a[i]) continue;
			for (int j = 0; j < m; j++) {
				if (b[j] || c[i][1] < d[j][1]) continue;
				if (d[j][0] - c[i][0] > mx) {
					mx = d[j][0] - c[i][0];
					x = i;
					y = j;
				}
			}
		}
		if (mx > 0) {
			res += mx;
			a[x] = true;
			b[y] = true;
		}
	}
	cout << res << '\n';
}

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