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

一，题目大意：

一个通信系统有n种设备组成，现有这n种设备，每种设备有不同价格以及性能的不同(量化为b)，要求是每种设备中选择一个，记取出的n个设备中的最小性能值为B，它们的价格总和为P，要计算可能的最大性价比B/P。

二，思路：

记dp[i][m]:取出的前n种设备，它们最低性能是m时，最低的可行价格。如果这种方案不存在，则dp[i][m] = -1.

则有如下转移方程：

if(dp[i-1][m] 有可行解), then 在所有第i种设备中遍历性能大于等于m的设备，并且更新dp[i][m](取最小)。

if(第i种设备中有性能恰好为m的设备存在)	遍历所有的dp[i-1][m+](m+ > m)，更新dp[i][m]。