Submission #874849

#TimeUsernameProblemLanguageResultExecution timeMemory
874849misu2005Art Exhibition (JOI18_art)C++11
50 / 100
1071 ms20624 KiB
#include <iostream> #include <algorithm> using namespace std; struct ceva { long long s, v; }; bool cmp(ceva a, ceva b) { return a.s < b.s; } int n; ceva v[500002]; int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> v[i].s >> v[i].v; sort(v+1, v+n+1, cmp); long long maxim = 0; for (int i = 1; i <= n; i++) { long long sum = 0; for (int j = i; j <= n; j++) { sum += v[j].v; maxim = max(maxim, sum - (v[j].s - v[i].s)); } } cout << maxim; 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...