제출 #887723

#제출 시각아이디문제언어결과실행 시간메모리
887723artixkrishnaArt Exhibition (JOI18_art)C++14
100 / 100
417 ms8532 KiB
#include <bits/stdc++.h> using namespace std; int N; pair<long long, int> X[505050]; int main(){ cin>>N; for(int i=0; i<N;i++){ long long A; int B; cin>>A>>B; X[i]=make_pair(A,B); } sort(X, X+N); long long ret=0, acc=0, lo=0; for(int i=0; i<N; i++){ lo=min(lo, acc-X[i].first); acc+=X[i].second; ret = max(ret, acc-X[i].first-lo); } cout<<ret<<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...