hdu2570 迷瘴

水题

#include <iostream>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#define inf 0x3f3f3f3f
#define ll long long
#define mod 1000000007
using namespace std;

double nongdu;
double w,p[110];
int n,V,v,i,t;

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d%lf",&n,&V,&w);
        w/=100;
        for(i=0;i<n;i++){
            scanf("%lf",&p[i]);
            p[i]/=100;
        }
        sort(p,p+n);
        nongdu=0;v=0;
        for(i=0;i<n;i++)
        {
            if((p[i]*V+v*nongdu)*1.0/(v+V)<=w)
            {
                nongdu=(p[i]*V+v*nongdu)*1.0/(v+V);
                v+=V;
            }
            else break;
        }
        printf("%d %.2lf\n",v,nongdu);
    }
    return 0;
}