Submission #1097920

#TimeUsernameProblemLanguageResultExecution timeMemory
1097920NewtonabcArt Exhibition (JOI18_art)C++14
0 / 100
0 ms348 KiB
#include<bits/stdc++.h>
#define mp make_pair
using namespace std;
vector<pair<long long,long long> > v;
int main(){
	int n;
	long long cur=0;
	cin>>n;
	for(int i=0;i<n;i++){
		long long a,b;
		cin>>a >>b;
		v.push_back(mp(a,b));
	}
	long long ans=LLONG_MIN;
	sort(v.begin(),v.end());
	for(int i=0;i<n;i++){
		if(i) cur-=v[i].first-v[i-1].first;
		cur+=v[i].second;
		if(cur<0) cur=v[i].second;
		ans=max(ans,cur);
	}
	cout<<ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...