O(n!)

https://ac.nowcoder.com/acm/contest/911/D

思路：贪心排序；对与两物品可以判断选取谁最少：a1+p1*a2和a2+a1*p2判断大小；因为每取一个就对另一个有p的影响所以可以排序；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e3+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

struct node
{
    int a;
    double p;
}x[maxn];

bool cmp(node x,node y)
{
    if(x.a+x.p*y.a<y.a+y.p*x.a) return 1;
    return 0;
}

int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n;
    cin>>n;
    for(int i=0;i<n;i++) cin>>x[i].a>>x[i].p;
    sort(x,x+n,cmp);
    double pp=1;
    double ans=0;
    for(int i=0;i<n;i++)
    {
        ans+=x[i].a*pp;
        pp=pp*x[i].p;
    }
    printf("%.6lf\n",ans);
}