# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
128868 | Plurm | Cake 3 (JOI19_cake3) | C++11 | 9 ms | 408 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;
long long sv[5048][5048];
int main(){
int n,m;
scanf("%d%d",&n,&m);
int v,c;
vector<pair<int,int> > pieces;
for(int i = 0; i < n; i++){
scanf("%d%d",&v,&c);
pieces.emplace_back(v,c);
}
sort(pieces.begin(), pieces.end(), [](pair<int,int> x, pair<int,int> y){
return x.second < y.second;
});
long long ans = 0ll;
for(int i = 0; i < n; i++){
long long highsum = 0ll;
for(int j = i+m-1; j < n; j++){
priority_queue<int, vector<int>, greater<int> > pq;
for(int k = i+1; k < j; k++){
pq.push(pieces[k].first);
}
while(pq.size() > m-2) pq.pop();
pq.push(pieces[i].first);
pq.push(pieces[j].first);
while(!pq.empty()){
highsum += 1ll * pq.top();
pq.pop();
}
highsum -= 2ll * abs(pieces[i].second - pieces[j].second);
ans = max(ans, highsum);
highsum = 0ll;
}
}
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... |