void solve() {
    int n,k; cin>>n>>k;
    vector<int> a(n);
    int sum  = 0;
    for(int i=0;i<n;++i) {
        int x; cin>>x;
        sum +=x;
        a[i] = x;
    }
    sort(a.begin(), a.end());
    vector<int> pre_sum(n+1, 0);
    for(int i=0;i<n;++i) pre_sum[i+1] = pre_sum[i] + a[i];
    int ans = 0;
    for(int i = 0;i<=k;++i) {
        int remove_right = pre_sum[n] - pre_sum[n-i];
        int remove_left = pre_sum[(k-i)*2];
        ans = max(ans, sum - remove_left - remove_right);
    }
    cout<<ans<<endl;
}