Submission #1345249

#TimeUsernameProblemLanguageResultExecution timeMemory
1345249ElayV13Art Exhibition (JOI18_art)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long
const int INF=1e18;

int n;
vector<pair<int,int>>aw;

signed main() 
{
  cin>>n;
  aw.resize(n);
  for(int i=0;i<n;i++) cin>>aw[i].first>>aw[i].second;
  sort(aw.begin(),aw.end());
  int res=-INF;
  for(int i=0;i<=0;i++){
    int s=0;
    for(int j=i;j<n;j++){
      s+=aw[j].second;
      res=max(res,s-(aw[j].first-aw[i].first));
    }
  }
  cout<<res<<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...