Submission #597576

#	Time	Username	Problem	Language	Result	Execution time	Memory
597576		hail	Hotel (CEOI11_hot)	C++17	20 / 100	4074 ms	19812 KiB

hot

#include <bits/stdc++.h>

using namespace std;

using ll=long long;

bool or_sor(pair<ll, ll> a, pair<ll, ll> b)
{
    if(a.first==b.first) return a.second<b.second;
    else return a.first>b.first;
}

void solve()
{
    ll n, m, o;
    cin>>n>>m>>o;

    vector<pair<ll, ll>> rooms(n);
    // cap upkeep

    vector<pair<ll,ll>> orders(m);
    // rent mincap

    for(int i=0; i<n; i++)
    {
        cin>>rooms[i].second>>rooms[i].first;
    }
    for(int i=0; i<m; i++)
    {
        cin>>orders[i].first>>orders[i].second;
    }

    sort(rooms.begin(), rooms.end());
    sort(orders.begin(), orders.end(), or_sor);

    vector<ll> max_prof(min(n, m));

    pair<ll, ll> ord;
    auto it=rooms.begin();

    for(ll i=0; i<min(m, n); i++)
    {
        ord=orders[i];
        it = lower_bound(rooms.begin(), rooms.end(), make_pair(ord.second, (ll) 0));
        max_prof[i]=ord.first-(*it).second;
        rooms.erase(it);
    }

    sort(max_prof.rbegin(), max_prof.rend());

    ll ans{};

    for(int i=0; i<o; i++)
    {
        if(max_prof[i]<=0) break;
        ans+=max_prof[i];
    }

    cout<<ans;

}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t=1;
    while(t--)
    {
        solve();
    }

    
}

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