# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
788504 | Ahmed57 | Cake 3 (JOI19_cake3) | C++17 | 4061 ms | 7904 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;
bool comp(pair<long long,long long> a,pair<long long,long long> b){
return a.second<b.second;
}
int main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int n,k;
cin>>n>>k;
vector<pair<long long,long long>> v(n);
for(int i = 0;i<n;i++){
cin>>v[i].first>>v[i].second;
}
sort(v.begin(),v.end(),comp);
long long all = -1e18;
for(int i = 0;i<n;i++){
long long ans = 2*v[i].second;
priority_queue<long long> q;
for(int j = i;j<n;j++){
ans+=v[j].first;
q.push(-v[j].first);
if(q.size()>k){
ans+=q.top();q.pop();
}
if(q.size()==k){
all = max(all,ans-2*v[j].second);
}
}
}
cout<<all<<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... |