# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
244593 | TadijaSebez | Hotel (CEOI11_hot) | C++11 | 1370 ms | 53352 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define ll long long
#define pb push_back
int main(){
multiset<pii> all;
int n,m,o;scanf("%i %i %i",&n,&m,&o);
for(int i=1;i<=n;i++){
int a,b;scanf("%i %i",&a,&b);
all.insert({b,a});
}
vector<pii> qs;
for(int i=1;i<=m;i++){
int a,b;scanf("%i %i",&a,&b);
qs.pb({a,b});
}
sort(qs.rbegin(),qs.rend());
vector<ll> vals;
for(auto q:qs){
auto it=all.lower_bound({q.second,0});
if(it!=all.end()&&it->second<q.first){
vals.pb(q.first-it->second);
all.erase(it);
}
}
sort(vals.rbegin(),vals.rend());
ll ans=0;
for(int i=0;i<vals.size()&&i<o;i++)ans+=vals[i];
printf("%lld\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |