poj 3300 前后轮

#include<iostream>
#include<algorithm>
using namespace std;
double cmp(double a,double b) {
if (a < b) return 1.0;
return 0.0;
}
int main() {
double f[100],r[100];
double d[500],ans[100];
int n , m;
while (scanf("%d%d",&n,&m)!=EOF) {
if (n == 0) break;
for (int i = 0 ; i < n ; i ++)
scanf("%lf",&f[i]);
for (int i = 0 ; i < m ; i ++)
scanf("%lf",&r[i]);
int g = 0;
for (int i = 0 ; i < n ; i ++)
for (int j = 0 ; j < m ; j ++) {
d[g++] = r[j]/f[i];
}
sort(d,d+g,cmp);
double max = 0;
for (int i = 1 ; i < g ; i ++)
max = (d[i]/d[i-1])>max ? (d[i]/d[i-1]) : max;
printf("%.2f\n",max);
}
}