제출 #868046

#제출 시각아이디문제언어결과실행 시간메모리
868046MongHwaArt Exhibition (JOI18_art)C++17
0 / 100
0 ms348 KiB
#include <iostream> #include <algorithm> using namespace std; #define ll long long #define X first #define Y second pair<ll, ll> arr[500001]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; for(int i = 0; i < n; i++) cin >> arr[i].X >> arr[i].Y; sort(arr, arr+n); ll ans = -1e18; ll cur = 0; for(int i = 0; i < n; i++) { if(ans < cur+arr[i].Y - arr[i].X) ans = cur+arr[i].Y - arr[i].X; if(cur < arr[i].X) cur = arr[i].X; cur += arr[i].Y; } cout << ans << '\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...