제출 #926615

#제출 시각아이디문제언어결과실행 시간메모리
926615VMaksimoski008Art Exhibition (JOI18_art)C++14
100 / 100
483 ms8276 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; int main() { int n; cin >> n; vector<array<ll, 2> > v(n+1); for(int i=1; i<=n; i++) cin >> v[i][0] >> v[i][1]; sort(v.begin()+1, v.end()); ll ans = 0, mx = -1e18, S = 0; for(int i=1; i<=n; i++) { mx = max(mx, v[i][0] - S); S += v[i][1]; ans = max(ans, S - v[i][0] + mx); } cout << ans << '\n'; 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...