Submission #234288

#TimeUsernameProblemLanguageResultExecution timeMemory
234288Toirov_SadiArt Exhibition (JOI18_art)C++17
0 / 100
5 ms384 KiB
#include<bits/stdc++.h> using namespace std; int n; vector<long long> p; vector<pair<long long, int>> a; int main() { cin >> n; for(int i = 1; i <= n; i ++){ int y; long long x; cin >> x >> y; a.push_back({x, y}); } sort(a.begin(), a.end()); p.resize(n, 0ll); for(int i = 0; i < n; i ++){ if(i > 0) p[i] = p[i - 1]; p[i] += a[i].second; } long long mx = 0ll; for(int i = 0; i < n; i ++){ mx = max(mx, p[i] - (a[i].first - a[0].first)); } cout << mx << "\n"; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...