// UVa 11242 - Tour de France #include <iostream> #include <vector> #include <algorithm> #include <stdio.h> using namespace std; int main() { int n, m; cin >> n; while (n) { cin >> m; int f[10], r[10]; for (int i = 0; i < n; i++) cin >> f[i]; for (int j = 0; j < m; j++) cin >> r[j]; vector<double> d; for (int i = 0; i < n; i++) for (int j = 0; j < m; j++) { d.push_back(r[j] * 1.0 / f[i]); } sort(d.begin(), d.end()); double sol = 0; for (int i = 1; i < d.size(); i++) { if (d[i] / d[i - 1] > sol) sol = d[i] / d[i - 1]; } printf("%.2f\n", sol); cin >> n; } return 0; }
No comments:
Post a Comment