POJ 1018

#include<iostream>
#define MAXN 105
#define inf 10000000
#include<vector>
#include<iomanip>
#include<algorithm>

using namespace std;

struct node
{
    double b;
    double p;
};

vector<double> coll;

node _m[MAXN][MAXN];
int size[MAXN];
int n;
void sort_f();
int main()
{
    //freopen("acm.acm","r",stdin);
    int i;
    int j;
    int k;
    double min;
    int test;
    double sum;
    double max;
    double temp;
    bool boo;
    cin>>test;
    while(test --)
    {
        boo = false;
        sum = ;
        max = -;
        cin>>n;
        for(i = ; i < n; ++ i)
        {
            cin>>size[i];
            for(j = ; j < size[i]; ++ j)
            {
                cin>>_m[i][j].b>>_m[i][j].p;
                coll.push_back(_m[i][j].b);
            }
        }
        sort(coll.begin(),coll.end());
        sort_f();
        for(k = ; k < coll.size(); ++ k)
        {
            if(k >  && coll[k] == coll[k-])
                continue;
            sum = ;
            for(i = ; i < n; ++ i)
            {
                min = inf;
                boo = false;
                for(j = ; j < size[i]; ++ j)
                {
                    if(_m[i][j].b >= coll[k])
                    {
                        if(_m[i][j].p < min)
                            min = _m[i][j].p;
                        boo = true;
                    }
                    else
                        break;
                }
                if(boo == false)
                {
                    sum = ;
                    break;
                }
                sum += min;
            }
            if(!boo)
                break;
            if( (temp = double(coll[k]/sum)) > max)
            {
                max = temp;
                //cout<<max<<endl
            }

        }
        cout<<setiosflags(ios::fixed)<<setprecision()<<max<<endl;
        coll.clear();
    }
}

void sort_f()
{
    int i;
    int j;
    int k;
    for(i = ; i < n; ++ i)
    {
        for(j = ; j < size[i]; ++ j)
        {
            for(k = j+; k < size[i]; ++ k)
            {
                if(_m[i][k].b > _m[i][j].b)
                {
                    iter_swap(&_m[i][k].b,&_m[i][j].b);
                    iter_swap(&_m[i][k].p,&_m[i][j].p);
                }
            }
        }
    }
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。

技术网站地址： vmfor.com