제출 #1229132

#제출 시각아이디문제언어결과실행 시간메모리
1229132xxducdatArt 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 l = 0, s = 0;
    for (int r = 0; r < n; r++) {
    s += art[r].second; 
    int Amax = art[r].first;
    int Amin = art[l].first;
    ans = max(ans,s-(Amax - Amin));
    }
	cout<<ans;
	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...