Submission #751105

#TimeUsernameProblemLanguageResultExecution timeMemory
751105vjudge1Art Exhibition (JOI18_art)C++14
50 / 100
1061 ms12020 KiB
#include<bits/stdc++.h> using namespace std; #define ll long long // manipulasi kiriman ll ans,n; ll pref[500500]; struct kiriman { ll w,v; }; kiriman a[500500]; bool compare(kiriman x, kiriman y) { return x.w < y.w; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for(int i=1; i<=n; i++) { cin >> a[i].w >> a[i].v; } sort(a+1,a+n+1,compare); for(int i=1; i<=n; i++) { pref[i] = pref[i-1] + a[i].v; } for(int i=1; i<=n; i++) { for(int j=i; j<=n; j++) { ans = max(ans, (pref[j] - pref[i-1] - (a[j].w - a[i].w))); } } cout << ans << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...