제출 #699416

#제출 시각아이디문제언어결과실행 시간메모리
699416TAhmed33Art Exhibition (JOI18_art)C++98
0 / 100
0 ms212 KiB
#include <bits/stdc++.h> using namespace std; #define int long long signed main () { int n; cin >> n; vector <pair <int, int>> arr(n + 1); arr[0] = {0, 0}; for (int i = 1; i <= n; i++) cin >> arr[i].first >> arr[i].second; sort(arr.begin(), arr.end()); for (int i = 1; i <= n; i++) arr[i].second += arr[i - 1].second; int sum = -1e18; int l = 1; for (int r = 1; r <= n; r++) { if (arr[r].first - arr[l].first > arr[r].second - arr[l - 1].second) l = r; sum = max(sum, -1 * arr[r].first + arr[l].first + arr[r].second - arr[l - 1].second); } cout << sum << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...