Submission #1109186

#TimeUsernameProblemLanguageResultExecution timeMemory
1109186giaminh2211Art Exhibition (JOI18_art)C++14
100 / 100
189 ms12108 KiB
#include<bits/stdc++.h> #define fn(n) for(int i=1; i<=n; i++) #define f1(n) for(int i=n; i>=1; i--) #define no cout << "NO"; #define yes cout << "YES"; #define el cout << '\n'; #define a first #define b second using namespace std; using ll=long long; int n; pair<ll, ll> a[500002]; ll f[500002]; ll res=-1e18; ll cur=-1e18; void nhap(){ cin >> n; for(int i=1; i<=n; i++){ cin >> a[i].a >> a[i].b; } sort(a+1, a+n+1); for(int i=1; i<=n; i++){ f[i]=f[i-1]+a[i].b; } } void solve(){ for(int i=n; i>=1; i--){ cur=max(cur, f[i]-a[i].a); res=max(res, cur+a[i].a-f[i-1]); } cout << res; } int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); nhap(); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...