/*
* PIE.cpp
*
* Created on: Jun 15, 2014
* Author: Arpit Bhayani
*/
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main() {
int T, N, F;
scanf("%d", &T);
while (T--) {
scanf("%d %d", &N, &F);
int r[N];
for (int i = 0; i < N; ++i) {
scanf("%d", &r[i]);
r[i] *= r[i];
}
sort(r, r + N);
double lo = 0, hi = 4e8, mi;
for (int it = 0; it < 43; ++it) {
mi = (lo + hi) / 2;
int cont = 0;
for (int i = N - 1; i >= 0 && cont <= F; --i)
cont += (int) floor(M_PI * r[i] / mi);
if (cont > F)
lo = mi;
else
hi = mi;
}
printf("%.4f\n", lo);
}
return 0;
}
System Design for Beginners
A masterclass that helps early engineers and product managers become great at designing scalable systems.
132+ learners
Details →System Design Masterclass
A masterclass that helps you become great at designing scalable, fault-tolerant, and highly available systems.
1000+ learners
Details →Redis Internals
Learn internals of Redis by re-implementing some of the core features in Golang.
98+ learners
Details →