Submission #211968

#TimeUsernameProblemLanguageResultExecution timeMemory
211968Harry464Art Exhibition (JOI18_art)C++14
100 / 100
817 ms25080 KiB
#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>

using namespace std;

#define ll long long

int main() {
  ll n;
  cin >> n;
  vector <pair <ll,ll> > a(n);
  for (int i = 0; i < n; i++)
   cin >> a[i].first >> a[i].second;
  sort(a.begin(),a.end());
  ll md = 0, ms = 0;
  vector <ll> kum(n+1,0);
  for (int i = 1; i <= n; i++)
   kum[i] = kum[i-1] + a[i-1].second;
  for (int i = 1; i <= n; i++){
    ll tren = kum[i] - a[i-1].first;
    md = min(md,kum[i-1] - a[i-1].first);
    tren -= md;
    ms = max(ms,tren);
  }
  cout << ms;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...