제출 #1033973

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033973		tuan121212	Art Exhibition (JOI18_art)	C++14	100 / 100	132 ms	14032 KiB

art

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
#define el cout << '\n';
using namespace std;

const int N = 5e5+5;
const int inf = 1e18;
const int LG = 31;
const int MOD = 1e9+7;
//const int mod = 998244353;

int n;
pair<int,int> a[N];
int dp[N],pre[N];
pair<int,int> b[N];

bool cmp(pair<int,int> x, pair<int,int> y){
	if(x.fi != y.fi) return x.fi < y.fi;
	return x.se > y.se;
}


void solve(){
    cin>>n;
    for(int i=1; i<=n; i++) cin>>a[i].fi >> a[i].se;
    sort(a+1,a+1+n,cmp);
    for(int i=1; i<=n; i++) pre[i] = pre[i-1] + a[i].se;
    int mx=0,ans=0;
    for(int i=1; i<=n; i++){
    	mx = max(mx, a[i].fi - pre[i-1]);
    	ans = max(ans , mx+pre[i]-a[i].fi);
	}
	cout << ans;
} 



signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int t = 1;
//	cin >> t;
	while (t--) {
		solve();
		el;
	}
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50