Submission #132697

#	Time	Username	Problem	Language	Result	Execution time	Memory
132697		Vardanyan	Hotel (CEOI11_hot)	C++14	100 / 100	1644 ms	81176 KiB

hot

#include <bits/stdc++.h>
using namespace std;
const int N = 500*1000+5;
long long c[N],p[N];
long long v[N],d[N];
bool cmp(pair<long long, long long> a, pair<long long,long> b){
    if(a.first>b.first) return a.first>b.first;
    if(a.first<b.first) return a.first>b.first;
    return a.second<b.second;
}
int main(){
    ios_base::sync_with_stdio(false);
    int n,m,k;
    cin>>n>>m>>k;
    multiset<pair<long long,long long> > ms;
    for(int i = 1;i<=n;i++){
        cin>>c[i]>>p[i];
        ms.insert({p[i],c[i]});
    }
    vector<pair<long long,long long> > all;
    for(int i = 1;i<=m;i++){
        cin>>v[i]>>d[i];
        all.push_back({v[i],d[i]});
    }
    sort(all.begin(),all.end(),cmp);
    int qn = k;
    long long ans = 0;
    vector<long long > pr;
    for(int i = 0;i<all.size();i++){
        if(!qn) break;
        long long x = all[i].second;
        if(ms.lower_bound({x,0}) == ms.end()) continue;
        pair<long long,long long> u = *ms.lower_bound({x,0});
        if(u.first>=x){
          if(all[i].first-u.second>0){
             //   ans-=u.second;
             //   ans+=all[i].first;
                ms.erase(ms.find(u));
               // qn--;
                pr.push_back(all[i].first-u.second);
            }
        }
    }
    sort(pr.rbegin(),pr.rend());
    for(int i = 0;i<pr.size();i++){
        if(!qn) break;
        qn--;
        ans+=pr[i];
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message (stderr)

hot.cpp: In function 'int main()':
hot.cpp:29:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<all.size();i++){
                   ~^~~~~~~~~~~
hot.cpp:45:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0;i<pr.size();i++){
                   ~^~~~~~~~~~

• 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