Submission #1190660

#TimeUsernameProblemLanguageResultExecution timeMemory
1190660akbarrArt Exhibition (JOI18_art)C++20
100 / 100
115 ms12240 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define run ios_base::sync_with_stdio(0);cin.tie(0); #define F first #define S second #define endl '\n' const int inf = 1e18+7; const int sz = 1e5+5; void solve() { int n; cin >> n; pair<int,int> a[n+1]; for(int i = 1; i <= n;i++) cin >> a[i].F >> a[i].S; sort(a+1,a+n+1); int psum[n+1]; psum[0] = 0; for(int i = 1; i <= n;i++){ psum[i] = psum[i-1] + a[i].S; } int best = -1; int mint = inf; for(int i = 1; i <= n;i++){ int t = psum[i-1] - a[i].F; mint = min(mint,t); int cost = psum[i] - a[i].F - mint; best = max(best,cost); } cout << best << endl; } signed main() { run; int t = 1; //cin >> t; while (t--) { solve(); } } // 11111100000
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...