Submission #77099

#TimeUsernameProblemLanguageResultExecution timeMemory
77099MohamedAhmed0Art Exhibition (JOI18_art)C++14
10 / 100
18 ms612 KiB
#include <bits/stdc++.h> using namespace std; int main() { long long n ; cin>>n ; long long arr[n] , arr1[n] ; for(long long i = 0 ; i < n ; ++i) cin>>arr[i]>>arr1[i] ; long long ans = 0 ; for(long long i = 1 ; i < (1 << n) ; ++i) { long long sum = 0 , MAX = 0 , MIN = 1e18 ; for(long long j = 0 ; j < n ; ++j) { if(i & (1 << j)) { sum += arr1[j] ; MAX = max(MAX , arr[j]); MIN = min(MIN , arr[j]); } } ans = max(ans , sum - (MAX - MIN)); } return cout<<ans , 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...