Submission #1049724

#	Time	Username	Problem	Language	Result	Execution time	Memory
1049724		vjudge1	Art Exhibition (JOI18_art)	C++17	0 / 100	0 ms	348 KiB

art

#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=0,curans=0,prevans=0,su=0;
      while(l<n){
            if(r<n){
                  su+=art[r].second;
                  curans=su-(art[r].first-art[l].first);
            }
            if(curans>=prevans and r<n){
                  r++;
                  prevans=curans;
            }else{
                  su-=art[l].second;
                  l++;
                  prevans=0;
            }
            ans=max(ans,curans);
      }
      cout<<ans<<endl;
      return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50