제출 #157124

#제출 시각아이디문제언어결과실행 시간메모리
157124GioChkhaidzeArt Exhibition (JOI18_art)C++14
100 / 100
261 ms24824 KiB
#include <bits/stdc++.h>
 
#define F first
#define S second
 
using namespace std;
 
const int N=500005;
 
long long n,ans,d[N];
pair < long long ,  long long > p[N];
 
int main() {
  	ios::sync_with_stdio(false);
	cin>>n;
 
	for (int i=1; i<=n; i++) {
		cin>>p[i].F>>p[i].S;
	}
 
	sort(p+1,p+n+1);
 
	for (int i=1; i<=n; i++) {
		d[i]=max(d[i-1]+p[i].S+p[i-1].F-p[i].F,p[i].S);
		ans=max(ans,d[i]);
	}
 
	cout<<ans<<endl;
 
	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...