Problem E. Bet

转载：https://blog.csdn.net/qq_40861916/article/details/84403731

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
long double arr[+];
void solve(int xx){
    int n;
    cin>>n;
    long double x,y;
    char a;
    for(int i=;i<=n;i++){
        cin>>x>>a>>y;
        arr[i]=x/(x+y);
    }
    sort(arr+,arr++n);
    long double sum=;
    int ans=;
    for(int i=;i<=n;i++){
        sum+=arr[i];
        if(sum<) ans++;
        else break;
    }
    printf("Case #%d: %d\n",xx,ans);
}

int main(){
    int t;
    cin>>t;
    for(int i=;i<=t;i++) solve(i);
    return ;
}