#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
 
using namespace std;
 
int main() {
    int t;
    cin >> t; // Number of test cases
 
    while (t--) {
        int n, k;
        cin >> n >> k; // Input size of array and number of initial blue elements
        vector<int> a(n);
 
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
 
        // Sort the array in descending order
        sort(a.begin(), a.end(), greater<int>());
 
        // First k elements selected as blue
        long long cost = 0;
        for (int i = 0; i < k; i++) {
            cost += a[i];
        }
 
        // Remaining red elements
        priority_queue<int> red_elements;
        for (int i = k; i < n; i++) {
            red_elements.push(a[i]);
        }
 
        // Simulating the spreading process
        while (!red_elements.empty()) {
            int current = red_elements.top();
            red_elements.pop();
            // Add the largest remaining red element to the cost
            cost += current;
            break; // Once the largest red element is added, stop
        }
 
        cout << cost << endl;
    }
 
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8cXVldWU+CiNpbmNsdWRlIDxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OyAvLyBOdW1iZXIgb2YgdGVzdCBjYXNlcwoKICAgIHdoaWxlICh0LS0pIHsKICAgICAgICBpbnQgbiwgazsKICAgICAgICBjaW4gPj4gbiA+PiBrOyAvLyBJbnB1dCBzaXplIG9mIGFycmF5IGFuZCBudW1iZXIgb2YgaW5pdGlhbCBibHVlIGVsZW1lbnRzCiAgICAgICAgdmVjdG9yPGludD4gYShuKTsKCiAgICAgICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICAgICAgY2luID4+IGFbaV07CiAgICAgICAgfQoKICAgICAgICAvLyBTb3J0IHRoZSBhcnJheSBpbiBkZXNjZW5kaW5nIG9yZGVyCiAgICAgICAgc29ydChhLmJlZ2luKCksIGEuZW5kKCksIGdyZWF0ZXI8aW50PigpKTsKCiAgICAgICAgLy8gRmlyc3QgayBlbGVtZW50cyBzZWxlY3RlZCBhcyBibHVlCiAgICAgICAgbG9uZyBsb25nIGNvc3QgPSAwOwogICAgICAgIGZvciAoaW50IGkgPSAwOyBpIDwgazsgaSsrKSB7CiAgICAgICAgICAgIGNvc3QgKz0gYVtpXTsKICAgICAgICB9CgogICAgICAgIC8vIFJlbWFpbmluZyByZWQgZWxlbWVudHMKICAgICAgICBwcmlvcml0eV9xdWV1ZTxpbnQ+IHJlZF9lbGVtZW50czsKICAgICAgICBmb3IgKGludCBpID0gazsgaSA8IG47IGkrKykgewogICAgICAgICAgICByZWRfZWxlbWVudHMucHVzaChhW2ldKTsKICAgICAgICB9CgogICAgICAgIC8vIFNpbXVsYXRpbmcgdGhlIHNwcmVhZGluZyBwcm9jZXNzCiAgICAgICAgd2hpbGUgKCFyZWRfZWxlbWVudHMuZW1wdHkoKSkgewogICAgICAgICAgICBpbnQgY3VycmVudCA9IHJlZF9lbGVtZW50cy50b3AoKTsKICAgICAgICAgICAgcmVkX2VsZW1lbnRzLnBvcCgpOwogICAgICAgICAgICAvLyBBZGQgdGhlIGxhcmdlc3QgcmVtYWluaW5nIHJlZCBlbGVtZW50IHRvIHRoZSBjb3N0CiAgICAgICAgICAgIGNvc3QgKz0gY3VycmVudDsKICAgICAgICAgICAgYnJlYWs7IC8vIE9uY2UgdGhlIGxhcmdlc3QgcmVkIGVsZW1lbnQgaXMgYWRkZWQsIHN0b3AKICAgICAgICB9CgogICAgICAgIGNvdXQgPDwgY29zdCA8PCBlbmRsOwogICAgfQoKICAgIHJldHVybiAwOwp9Cg==

MwozIDEKMSAyIDMKNSAyCjQgMiAzIDEgMwo0IDMKMiAyIDIgMgo=

3
3 1
1 2 3
5 2
4 2 3 1 3
4 3
2 2 2 2