#include <cassert>
#include <iostream>
#include <algorithm>
#include <iomanip>

using namespace std;

const int MAXN = 100000 + 5;

int tn, n, a[MAXN], k;

int main(int argc, const char * argv[]) {
    cout << fixed << setprecision(10);
    cin >> tn;
    assert(1 <= tn && tn <= 100);
    while (tn--) {
        cin >> n >> k;
        assert(1 <= n && n <= 10000);
        assert(0 <= 2 * k && 2 * k < n);
        for(int i = 1; i <= n; i++) {
            cin >> a[i];
            assert(-1000000 <= a[i] && a[i] <= 1000000);
        }
        sort(a + 1, a + n + 1);
        long long sum = 0;
        for(int i = k + 1; i <= n - k; i++)
            sum += a[i];
        cout << 1.0 * sum / (n - 2 * k) << endl;
    }
    return 0;
}