제출 #443219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
443219		prvocislo	Hotel (CEOI11_hot)	C++17	100 / 100	526 ms	39988 KiB

hot

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

struct room { ll c, p; };
bool cmproom(const room &a, const room &b) 
{
    if (a.c == b.c) return a.p < b.p;
    return a.c < b.c;
}
bool cmpoffer(const room &a, const room &b) 
{
    return a.p < b.p;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); 
    int n, m, k;
    cin >> n >> m >> k;
    vector<room> r(n), o(m);
    for (int i = 0; i < n; i++) cin >> r[i].c >> r[i].p;
    sort(r.begin(), r.end(), cmproom);
    for (int i = 0; i < m; i++) cin >> o[i].c >> o[i].p;
    sort(o.begin(), o.end(), cmpoffer);
    multiset<ll, greater<ll>> best;
    vector<ll> v;
    for (int i = 0, j = 0; i < n; i++)
    {
        while (j < m && o[j].p <= r[i].p) best.insert(o[j++].c);
        if (!best.empty())
        {
            ll x = *best.begin(); best.erase(best.begin());
            v.push_back(x - r[i].c);
        }
    }
    sort(v.begin(), v.end(), greater<ll>());
    ll ans = 0, sum = 0;
    for (int i = 0; i < min((int)v.size(), k); i++) sum += v[i], ans = max(ans, sum);
    cout << ans << "\n";
    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