제출 #1283856

#제출 시각아이디문제언어결과실행 시간메모리
1283856arashmemarArt Exhibition (JOI18_art)C++20
100 / 100
434 ms8320 KiB
#include <bits/stdc++.h> using namespace std; const int maxn = 1e6; pair <long long int, long long int> a[maxn]; int main() { int n; cin >> n; for (int i = 1;i <= n;i++) { cin >> a[i].first >> a[i].second; } sort(a + 1, a + 1 + n); long long int ans = a[n].second, mx = a[n].second; for (int i = n - 1;i;i--) { mx = max(mx - a[i + 1].first + a[i].first + a[i].second, a[i].second); ans = max(mx, ans); } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...