Submission #649987

#TimeUsernameProblemLanguageResultExecution timeMemory
649987Markomafko972Art Exhibition (JOI18_art)C++14
100 / 100
205 ms20888 KiB
#include <bits/stdc++.h> #define X first #define Y second #define pb push_back #define pii pair<int, int> typedef long long ll; using namespace std; const int MOD = 1e9 + 7; const ll INF = 1e18; const int OFF = (1 << 20); int n; long long a, b, maxi, sol; pair<long long, long long> p[500005]; int main () { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 0; i < n; i++) { cin >> p[i].X >> p[i].Y; } sort(p, p + n); for (int i = 0; i < n; i++) { a = p[i].X; b = p[i].Y; maxi = max(maxi+b, a+b); sol = max(sol, maxi-a); } cout << sol; 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...