Submission #1071541

#	Time	Username	Problem	Language	Result	Execution time	Memory
1071541		vjudge1	Art Exhibition (JOI18_art)	C++98	10 / 100	5 ms	460 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=1e6+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];

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);
	for(int i = 0 ; i < (1 << n) ; i++){
		int mx=0,mn=INF,sm=0;
		for(int j = 0 ; j < n ; j++){
			if(i & (1 << j)){
				mx=max(p[j+1].first,mx);
				if(mn > p[j+1].first) mn=p[j+1].first;
				sm+=p[j+1].second;
			}
		}
		if(ans < sm-(mx-mn) and sm-(mx-mn) != INF) ans=sm-(mx-mn);
	}
	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: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 50