1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
|
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
constexpr ll MAXN=static_cast<ll>(5e3)+10,INF=static_cast<ll>(5e18)+3;
ll N,K,T,A[MAXN],sortA[MAXN];
ll pos[MAXN];
bool vis[MAXN];
inline bool cmp(const ll &a,const ll &b){
return A[a]>A[b];
}
inline void solve(){
cin>>N>>K;
FOR(i,1,N){
cin>>A[i];
sortA[i]=A[i];
}
sort(sortA+1,sortA+1+N);
FOR(i,1,N){
pos[i]=i;
}
sort(pos+1,pos+1+N,cmp);
ll ansT=0;
FOR(i,1,K){
vis[pos[i]]=true;
ansT+=A[pos[i]];
}
ll ans=ansT;
if(K!=1){
ans+=A[pos[K+1]];
cout<<ans<<"\n";
}else{
ans=0;
FOR(i,1,N){
ll lans=0;
if(i==1){
lans+=A[1];
lans+=A[N];
}else if(i==N){
lans+=A[N];
lans+=A[1];
}else{
lans+=A[i];
lans+=max(A[1],A[N]);
}
ans=max(ans,lans);
}
cout<<ans<<"\n";
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>T;
while(T--){
solve();
}
return 0;
}
|