This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |