Submission #272063

#TimeUsernameProblemLanguageResultExecution timeMemory
272063okaragulArt Exhibition (JOI18_art)C++17
50 / 100
1078 ms20728 KiB
#include<bits/stdc++.h>
using namespace std;

#define lli long long
#define INF LONG_LONG_MAX
#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define endl '\n'
#define max(aa, bb) (aa > bb ? aa:bb)
#define min(aa, bb) (aa < bb ? aa:bb)
#define all(aa) aa.begin(), aa.end()

int main(){
	lli n;
	cin>>n;
	
	vector<pair<lli,lli>>v(n);
	for(auto &it:v){
		cin>>it.st>>it.nd;
	}

	sort(all(v));

	lli tmp=v[0].nd, cvp=0;

	for(lli i=1;i<n;i++){
		tmp=max(tmp-v[i].st+v[i-1].st+v[i].nd, v[i].nd);
		cvp=max(cvp, tmp);
	}
	cout<<cvp<<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...