Submission #1275088

#TimeUsernameProblemLanguageResultExecution timeMemory
1275088k12_khoiSure Bet (CEOI17_sure)C++17
20 / 100
2096 ms572 KiB
#include <bits/stdc++.h>
using namespace std;

#define int long long

const int N=1e6+5;

int n; double res;
double a[N],b[N];

void ql(int i,double x,double y,int used)
{
    if (i>2*n)
    {
        res=max(res,min(x,y)-used);
        return;
    }

    ql(i+1,x,y,used);

    if (i<=n) ql(i+1,x+a[i],y,used+1);
    else ql(i+1,x,y+b[i-n],used+1);
}

signed main()
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL); cout.tie(NULL);

    cin >> n;

    for (int i=1;i<=n;i++)
    cin >> a[i] >> b[i];

    res=0;
    ql(1,0,0,0);

    cout << setprecision(4) << fixed << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...