#include<bits/stdc++.h>usingnamespace std;typedeflonglong ll;typedeflongdouble ld;typedef pair<int,int> pii;constint maxn=1e6+5;int a[maxn],b[maxn];voidsolve(){int n, k;
cin >> n >> k;for(int i =0;i<n;i++){
cin >> a[i];}sort(a, a + n);
ll sum =0;for(int i =0; i < n-(2*k);i++)
sum += a[i];int m =0;for(int i = n -(2* k); i < n;i++){
b[m++]= a[i];}for(int i =0; i < k;i++){
sum += b[i]/ b[i+k];//关键}
cout << sum << endl;}intmain(){
ios::sync_with_stdio(0);int t;
cin >> t ;while(t--){solve();}return0;}
A. Polycarp and Sums of Subsequences题目描述思路:只有7个数,暴力就完事了code:#include<bits/stdc++.h>using namespace std;typedef long long ll;typedef long double ld;typedef pair<int,int> pii;const int maxn=1e6+5;void solve(){ int n = 7; int a