#include <bits/stdc++.h>
using namespace std;
const int N=1e3+2;
long long a[N],b[N],c[N];
long long n,value,masiz,misiz,res=0;
void backtrack(int x)
{
if(x>n)
{
value=0,masiz=0,misiz=1e18;
for(int i=1; i<=n; i++)
{
if(c[i]==1)
{
value+=b[i];
masiz=max(masiz,a[i]);
misiz=min(misiz,a[i]);
}
}
if(masiz!=0 && misiz!=1e18)
{
res=max(res,value-(masiz-misiz));
}
}
else
{
for(int m=0; m<=1; m++)
{
c[x]=m;
backtrack(x+1);
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie();
cin >> n;
for(int i=1; i<=n; i++) cin >> a[i] >> b[i];
backtrack(1);
cout << res;
}
# | 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... |