제출 #1049741

#제출 시각아이디문제언어결과실행 시간메모리
1049741vjudge1Art Exhibition (JOI18_art)C++17
0 / 100
0 ms348 KiB
#include<algorithm> #include<iostream> #include<vector> #include<queue> #include<set> using namespace std; #define ll long long const ll maxn=500001; ll n,ans=0; pair<ll,ll> art[maxn]; int main(){ cin>>n; for(int i=0;i<n;i++){ cin>>art[i].first>>art[i].second; } sort(art,art+n); ll l=0,r=1,curans=0,prevans=0,su=art[0].second; while(l<n){ curans=su-(art[r-1].first-art[l].first); if(curans>=prevans and r<n){ r++; su+=art[r-1].second; prevans=curans; }else{ su-=art[l].second; l++; prevans=0; } r=max(r,l); ans=max(ans,curans); } cout<<ans<<endl; 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...