제출 #718285

#제출 시각아이디문제언어결과실행 시간메모리
718285Yell0Art Exhibition (JOI18_art)C++98
100 / 100
166 ms8164 KiB
#include <bits/stdc++.h>
#define sz first
#define v second
 
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const int MN=5e5+2;
int N;
pll a[MN];
 
int main() {
  ios::sync_with_stdio(0);cin.tie(0);
  cin>>N;
  for(int i=1;i<=N;++i) cin>>a[i].sz>>a[i].v;
  sort(a+1,a+1+N);
  ll ans=0,tot=0,sub=0;
  for(int i=1;i<=N;++i) {
    sub=min(sub,tot-a[i].sz);
    tot+=a[i].v;
    ans=max(ans,tot-a[i].sz-sub);
  }
  cout<<ans<<'\n';
  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...