Submission #709998

#TimeUsernameProblemLanguageResultExecution timeMemory
709998Darren0724Cake 3 (JOI19_cake3)C++17
5 / 100
4072 ms360 KiB
#include<bits/stdc++.h> using namespace std; #define all(x) x.begin(),x.end() #define int long long #define x first #define y second const int INF=1e18; int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n,m;cin>>n>>m; vector<pair<int,int>> v(n); for(int i=0;i<n;i++){ cin>>v[i].y>>v[i].x; } sort(v.begin(),v.end()); int ans1=-INF; for(int i=0;i<n;i++){ for(int j=i+m;j<=n;j++){ vector<int> p; for(int k=i;k<j;k++){ p.push_back(v[k].y); } sort(all(p),greater<>()); int ans=0; for(int k=0;k<m;k++){ ans+=p[k]; } ans-=(v[j-1].x-v[i].x)*2; //cout<<i<<' '<<j<<' '<<ans<<endl; ans1=max(ans1,ans); } } cout<<ans1<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...