제출 #1071586

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1071586		vjudge1	Art Exhibition (JOI18_art)	C++98	0 / 100	1 ms	2396 KiB

art

// Balgabaev Mansur
#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define pb push_back
#define int long long


using namespace std;

const int N=1e5+7;
const int MOD=1e9+7;
const int INF=1e18;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

pair<int,int>p[N];
pair<int,int>p1[N];

void solve(){
	int n;
	cin >> n;
	int ans=0;
	for(int i = 1 ; i <= n ; i++){
		cin >> p[i].first >> p[i].second;
		ans=max(ans,(p[i].second-p[i].first));
	}
	sort(p+1,p+1+n);
	int mxsz=0,mnsz=INF,sm=0;
	for(int i = 1 ; i <= n ; i++){
		mxsz=max(mxsz,p[i].first);
		mnsz=min(mnsz,p[i].first);
		sm+=p[i].second;
		ans=max(ans,(sm-(mxsz-mnsz)));
	}
	mxsz=0;
	mnsz=INF;
	sm=0;
	for(int i = n ; i >= 1 ; i--){
		mxsz=max(mxsz,p[i].first);
		mnsz=min(mnsz,p[i].first);
		sm+=p[i].second;
		ans=max(ans,(sm-(mxsz-mnsz)));
	}
	cout << ans;
}	
 
signed main() {
   // freopen("closing.in", "r", stdin);
   // freopen("closing.out", "w", stdout);
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int test = 1,cntx=1;
    //cin >> test;
    while (test--) {
	//cout << "Case " << 	cntx << ':' << '\n';
        solve();
        cntx++;
	}		
    return 0;
}

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