Submission #1049744

#TimeUsernameProblemLanguageResultExecution timeMemory
1049744vjudge1Art Exhibition (JOI18_art)C++17
50 / 100
1065 ms8036 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);
      for(int i=0;i<n;i++){
            ll su=0;
            for(int j=i;j<n;j++){
                  su+=art[j].second;
                  ans=max(ans,su-(art[j].first-art[i].first));
            }
      }
      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...