oj.uz

Submission #595470

# Submission time Handle Problem Language Result Execution time Memory
595470 2022-07-13T18:49:18 Z Belphegor Art Exhibition (JOI18_art) C++14
0 / 100
 4 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll A[16],B[16];

int main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	int n; cin>>n;
	for(int i=0; i<n; i++) cin>>A[i]>>B[i];
	ll ans = 0;
	for(int i=1; i<(1<<n); i++){
		ll s = 0;
		ll mx = -1,mn = INT64_MAX;
		for(int j=0; j<n; j++){
			if(i&(1<<j)){
				s+=B[j];
				mn = min(mn,A[j]);
				mx = max(mx,A[j]);
			}
		}
		ans = max(ans,s+(mx-mn));
	}
	cout<<ans;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -