제출 #703366

#제출 시각아이디문제언어결과실행 시간메모리
7033661075508020060209tcArt Exhibition (JOI18_art)C++14
100 / 100
476 ms24796 KiB
//#pragma GCC optimize("O3") #include<bits/stdc++.h> using namespace std; #define int long long #define X first #define Y second int n; pair<int,int>ar[1000006];int ps[1000006]; signed main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>ar[i].first>>ar[i].second; } sort(ar+1,ar+n+1); for(int i=1;i<=n;i++){ ps[i]=ar[i].second+ps[i-1]; } int ans=-1e17; int mnad=0+ar[1].first; for(int i=1;i<=n;i++){ ans=max(ans,mnad+ps[i]-ar[i].first); mnad=max(mnad,-ps[i]+ar[i+1].first); } cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...