Submission #714043

#TimeUsernameProblemLanguageResultExecution timeMemory
714043mdubArt Exhibition (JOI18_art)C++14
100 / 100
644 ms44324 KiB
#include <bits/stdc++.h>

using namespace std;
typedef long long LL;

int main () {
  int 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());
  set<LL> s;
  LL sum = 0;
  LL ans = 0;
  for (int i = 0; i < n; i++) {
    s.insert(sum - a[i].first);
    sum += a[i].second;
    ans = max(ans, (sum - a[i].first) - (*(s.begin())));
  }
  cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...