# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093343 | mar | Hotel (CEOI11_hot) | C++14 | 686 ms | 39764 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;
typedef long long ll;
set<pair<int,int>>room;
int main() {
int n,m,o; cin>>n>>m>>o;
for(int i = 0; i<n; i++) {
int c, p; cin>>c>>p;
room.insert({p, c});
}
vector<pair<int,int>> of(m);
for(int i = 0; i < m; i++) {
cin>>of[i].first>>of[i].second;
}
sort(of.begin(), of.end());
reverse(of.begin(), of.end());
vector<int>vals;
for(int i=0; i<m; i++) {
auto it = room.lower_bound({of[i].second, 0});
if(it == room.end()) {
continue;
}
vals.push_back(of[i].first-it->second);
room.erase(it);
}
sort(vals.rbegin(), vals.rend());
ll ans = 0;
for(int i=0; i<vals.size() && i<o; i++) {
ans += max(vals[i], 0);
}
cout<<ans<<endl;
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... |