Communication System

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 using namespace std;
 6 
 7 const int INF=1e8;
 8 
 9 int kase,n,m;
10 int dp[105][1005];
11 
12 void Inite(){
13     for(int i=0;i<105;i++)
14         for(int j=0;j<1005;j++) dp[i][j]=INF;
15 }
16 
17 void Print(){
18     double ans=0;
19     for(int i=1;i<1005;i++) if(dp[n][i]!=INF) ans=max(ans,(double)i/(double)dp[n][i]);
20     printf("%.3lf\n",ans);
21 }
22 
23 void Solve(){
24     cin>>n;
25     for(int i=1;i<=n;i++){
26         cin>>m;
27         for(int j=1;j<=m;j++){
28             int a,b;
29             scanf("%d%d",&a,&b);
30             if(i==1){ dp[1][a]=b; continue;}
31             for(int k=0;k<1005;k++){ 
32                 if(dp[i-1][k]!=INF){
33                     if(k<=a) dp[i][k]=min(dp[i][k],dp[i-1][k]+b); 
34                     else dp[i][a]=min(dp[i][a],dp[i-1][k]+b);
35                 }
36             }
37         }
38     }
39     Print();
40 }
41 
42 int main()
43 {   cin>>kase;
44     while(kase--){
45         Inite();
46         Solve();
47     }
48     return 0;
49 }