Submission #283514

#TimeUsernameProblemLanguageResultExecution timeMemory
283514sofapudenArt Exhibition (JOI18_art)C++14
50 / 100
1080 ms20856 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main(){ int n; cin >> n; vector<pair<ll,ll>> v(n); for(auto &i : v)cin >> i.first >> i.second; sort(v.begin(), v.end()); ll ma = v[0].second; ll cur = v[0].second; for(int i = 1; i < n; ++i){ cur+=v[i].second; cur-=(v[i].first-v[i-1].first); cur = max(cur, v[i].second); ma = max(ma,cur); } cout << ma << "\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...