Submission #1278079

#TimeUsernameProblemLanguageResultExecution timeMemory
1278079bnijaamaaArt Exhibition (JOI18_art)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define all(x) (x).begin() + 1, (x).end() #define F first #define S second #define nn '\n' #define pb push_back signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<pair<int, int>> a(n + 1); for (int i = 1; i <= n; i++) { cin >> a[i].F >> a[i].S; } sort(all(a)); vector<int> p(n + 1, 0); for (int i = 1; i <= n; i++) { p[i] = p[i - 1] + a[i].S; } int mn = 1e18; int ans = -1; for (int r = 1; r <= n; r++) { ans = max(ans, p[r] - a[r].F - mn); mn = min(mn, p[r - 1] - a[r].F); } cout << ans << nn; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...