제출 #1316862

#제출 시각아이디문제언어결과실행 시간메모리
1316862exoworldgdArt Exhibition (JOI18_art)C++20
100 / 100
131 ms12092 KiB
#include<bits/stdc++.h> #define int long long #define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0) using namespace std; const int N=5e5+5,inf=1e18; int n,q[N],ans,mx=-inf; array<int,2>a[N]; signed main(void){ exoworldgd; cin>>n; for(int i=1;i<=n;i++)cin>>a[i][0]>>a[i][1]; sort(a+1,a+n+1); for(int i=1;i<=n;i++)q[i]=q[i-1]+a[i][1]; for(int i=1;i<=n;i++)mx=max(mx,-q[i-1]+a[i][0]),ans=max(ans,q[i]-a[i][0]+mx); cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...