POJ1018--Communication System

Description

We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufacturers. Same devices from two manufacturers differ in their maximum bandwidths and prices.  
By overall bandwidth (B) we mean the minimum of the bandwidths of the chosen devices in the communication system and the total price (P) is the sum of the prices of all chosen devices. Our goal is to choose a manufacturer for each device to maximize B/P.  

Input

The first line of the input file contains a single integer t (1 ≤ t ≤ 10), the number of test cases, followed by the input data for each test case. Each test case starts with a line containing a single integer n (1 ≤ n ≤ 100), the number of devices in the communication system, followed by n lines in the following format: the i-th line (1 ≤ i ≤ n) starts with mi (1 ≤ mi ≤ 100), the number of manufacturers for the i-th device, followed by mi pairs of positive integers in the same line, each indicating the bandwidth and the price of the device respectively, corresponding to a manufacturer.

Output

Your program should produce a single line for each test case containing a single number which is the maximum possible B/P for the test case. Round the numbers in the output to 3 digits after decimal point.  

Sample Input

1 3
3 100 25 150 35 80 25
2 120 80 155 40
2 100 100 120 110

Sample Output

0.649

PS:这种类型的DP可以先限制一个量。
/*
这样的话此题应该是枚举带宽，然后将所有的品种，每个品种进行排序，按价格。
这样我们在寻找的时候只需要找一个价格最小的且带宽》=选定的就行了
*/
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n;
struct JQ
{
	int b,p,id;
}jq[108][108];
struct BB
{
	int b,id,p;
}bb[10008];
int len[108];
bool cmp(JQ a,JQ b)
{
	return a.p < b.p;
}
double get(int b,int x,int p)
{
	int P=p;
	for(int i=1;i<=n;i++)
	{
		if(i == x) continue;
		bool flag = false;
		for(int j=1;j<=len[i];j++)
		{
			if(jq[i][j].b >= b)
			{
				P += jq[i][j].p;
				flag = true;
				break;
			}
		}
		if(!flag) return -1;
	}
	return b/double(P);
}
double max(double a,double b)
{
	return a>b?a:b;
}
int main()
{
	//freopen("in.txt","r",stdin);
	int t;
	scanf("%d",&t);
	while(t--)
	{
		int k=0;
		scanf("%d",&n);;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&len[i]);
			for(int j=1;j<=len[i];j++)
			{
				scanf("%d%d",&jq[i][j].b,&jq[i][j].p);
				bb[k].b = jq[i][j].b;
				bb[k].p = jq[i][j].p;
				bb[k++].id = i;
			}///id就不用了。直接可以看
			//接下来就要进行排序先。按照价格
		}
		for(int i=1;i<=n;i++)
		{
			sort(jq[i]+1,jq[i]+len[i]+1,cmp);
		}
		double ans = 0;
		for(int i=0;i<k;i++)
		{
			ans = max(ans,get(bb[i].b,bb[i].id,bb[i].p));
		}
		printf("%.3lf\n",ans);
	}
	return 0;
}