Submission #1229117

#TimeUsernameProblemLanguageResultExecution timeMemory
1229117xxducdatArt Exhibition (JOI18_art)C++20
0 / 100
0 ms320 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
	int n;
	cin>>n;
	vector< pair< int , int > > art(n);
	for(int i=0;i<n;i++){
		cin>>art[i].first>>art[i].second;
	}
	sort(art.begin(),art.end());
	int ans=LLONG_MIN;
	int ami=art[0].first;
	int s=0;
	for(int i=0;i<n;i++){
        s += art[i].second;
        int ama=art[i].first;
        int tmp=s-(ama-ami);
        ans = max(ans, tmp);
    }
	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...