Submission #751097

#TimeUsernameProblemLanguageResultExecution timeMemory
751097vjudge1Art Exhibition (JOI18_art)C++17
50 / 100
1071 ms20672 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define fi first #define se second int N; pair<int,int>P[500005]; signed main() { cin>>N; for(int i = 1;i<=N;i++){ cin>>P[i].fi>>P[i].se; } sort(P+1,P+1+N); for(int i = 2;i<=N;i++){ P[i].se+=P[i-1].se; } // for(int i = 0;i<=N;i++){ // cout<<P[i].fi<<":"<<P[i].se<<endl; // } int ans=-1e18; for(int i = 1;i<=N;i++){ for(int j = i;j<=N;j++){ ans=max(ans,(P[j].se-P[i-1].se)-(P[j].fi-P[i].fi)); } } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...