Submission #289629

#TimeUsernameProblemLanguageResultExecution timeMemory
289629Ruba_KArt Exhibition (JOI18_art)C++14
10 / 100
5 ms384 KiB
#include <bits/stdc++.h> using namespace std; const int N = 5e5 + 1 ; #define ll long long ll sz[N] , v[N]; int main() { int n ; cin >> n ; for(int i = 0 ; i < n ; i ++) cin >> sz[i] >> v[i]; long long mx = 0 , sum = 0 ; for(int i = 1 ; i < (1 << n) ; i ++){ long long mxx = -1e18 , mnn = 1e18 ; sum = 0 ; for(int mask = 0 ; mask < n ; mask++){ if(i & (1 << mask)) mxx = max(mxx , sz[mask]) , mnn = min(mnn , sz[mask]) , sum += v[mask]; } mx = max(mx , sum - mxx + mnn); } cout << mx ; 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...