CF1832B.Maximum Sum
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given an array a1,a2,…,an , where all elements are different.
You have to perform exactly k operations with it. During each operation, you do exactly one of the following two actions (you choose which to do yourself):
- find two minimum elements in the array, and delete them;
- find the maximum element in the array, and delete it.
You have to calculate the maximum possible sum of elements in the resulting array.
输入格式
The first line contains one integer t ( 1≤t≤104 ) — the number of test cases.
Each test case consists of two lines:
- the first line contains two integers n and k ( 3≤n≤2⋅105 ; 1≤k≤99999 ; 2k<n ) — the number of elements and operations, respectively.
- the second line contains n integers a1,a2,…,an ( 1≤ai≤109 ; all ai are different) — the elements of the array.
Additional constraint on the input: the sum of n does not exceed 2⋅105 .
输出格式
For each test case, print one integer — the maximum possible sum of elements in the resulting array.
输入输出样例
输入#1
6 5 1 2 5 1 10 6 5 2 2 5 1 10 6 3 1 1 2 3 6 1 15 22 12 10 13 11 6 2 15 22 12 10 13 11 5 1 999999996 999999999 999999997 999999998 999999995
输出#1
21 11 3 62 46 3999999986
说明/提示
In the first testcase, applying the first operation produces the following outcome:
- two minimums are 1 and 2 ; removing them leaves the array as [5,10,6] , with sum 21 ;
- a maximum is 10 ; removing it leaves the array as [2,5,1,6] , with sum 14 .
21 is the best answer.
In the second testcase, it's optimal to first erase two minimums, then a maximum.