Problem E. Bet

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

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

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

 

你可能感兴趣的:(Problem E. Bet)