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(){
int n;
cin>>n;
long long a[n], b[n];
for(int i=0; i<n; i++){
cin>>a[i]>>b[i];
}
long long ans = 0;
for(int bit=1; bit<int(pow(2, n)); bit++){
long long mx = -1;
long long mn = 1e15 + 1;
long long sum = 0;
for(int j=0; j<n; j++){
if((bit & (1 << j)) > 0){
sum += b[j];
mx = max(mx, a[j]);
mn = min(mn, a[j]);
}
}
ans = max(ans, sum-(mx-mn));
}
cout<<ans<<endl;
return 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... |