Pagini recente » Cod sursa (job #1150832) | Cod sursa (job #2851893) | Cod sursa (job #2598182) | Cod sursa (job #1309188) | Cod sursa (job #2369497)
#include <fstream>
using namespace std;
ifstream fin ("secv3.in");
ofstream fout ("secv3.out");
int cost[30005], time[30005], d[30005];
int main()
{
int n, mn, mx, sum1 = 0, sum2 = 0;
double ans = 0;
fin >> n >> mn >> mx;
for(int i = 1; i <= n; ++i) fin >> cost[i];
for(int i = 1; i <= n; ++i) fin >> time[i];
int F = 1, L = 0;
for(int i = 1; i <= mn; ++i) d[++L] = i, sum1 += cost[d[L]], sum2 += time[d[L]];
ans = max(ans, 1.0 * sum1 / sum2);
for(int i = mn + 1; i <= n; ++i) {
sum1 -= cost[d[F]], sum2 -= time[d[F]];
++F, d[++L] = i;
sum1 += cost[d[L]], sum2 += time[d[L]];
ans = max(ans, 1.0 * sum1 / sum2);
}
fout << ans;
return 0;
}