Submission #1276873

#TimeUsernameProblemLanguageResultExecution timeMemory
1276873LmaoLmaoArt Exhibition (JOI18_art)C++20
0 / 100
0 ms332 KiB
#include<bits/stdc++.h> #define fi first #define se second #define int long long using namespace std; using ll = long long; using ii = pair<int, int>; using aa = array<int,3>; const int N = 5e5+5; const int INF = 1e9; const int MOD = 998244353; ii a[N]; int pre[N]; signed main() { ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL); int n; cin >> n; for(int i=1;i<=n;i++) { cin >> a[i].fi >> a[i].se; } sort(a+1,a+1+n); int ans=0; int tmp=-a[1].fi; for(int i=1;i<=n;i++) { pre[i]=pre[i-1]+a[i].se; ans=max(ans,pre[i]-a[i].fi-tmp); tmp=min(tmp,pre[i]-a[i+1].se); //cout << tmp << endl; } cout << ans; 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...