Submission #927839

#TimeUsernameProblemLanguageResultExecution timeMemory
927839takeonickyArt Exhibition (JOI18_art)C++14
50 / 100
1055 ms24660 KiB
#include<bits/stdc++.h>
using namespace std;

int main(){
	int n;
	cin>>n;
	pair<long long, long long> arr[n];
	for(int i=0; i<n; i++){
		cin>>arr[i].first>>arr[i].second;
	}
	sort(arr, arr+n);
	
	long long pref[n];
	pref[0] = arr[0].second;
	for(int i=1; i<n; i++){
		pref[i] = pref[i-1] + arr[i].second;
	}
	
	long long ans = 0;
	for(int l=0; l<n; l++){
		for(int r=l; r<n; r++){
			long long sum = pref[r];
			if(l != 0) sum -= pref[l-1];
			ans = max(ans, sum-(arr[r].first-arr[l].first));
		}
	}
	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...