fork download
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <cstdlib>
  4. using namespace std;
  5.  
  6. int cmp(const void *a, const void *b) {
  7. return (*(int*)a - *(int*)b);}
  8.  
  9. int main() {
  10. int t, n, k, w[105], tot, cnt1, cnt2;
  11. scanf("%d", &t);
  12. while(t--) {
  13. scanf("%d %d", &n, &k);
  14. cnt1=cnt2=tot=0;
  15. for(int i=0; i<n; i++) {
  16. scanf("%d", &w[i]);
  17. tot += w[i];
  18. }
  19. qsort(w, n, sizeof(int), cmp);
  20. for(int i=0; i<k; i++) cnt1 += w[i];
  21. for(int i=n-1; i>n-k-1; i--) cnt2 += w[i];
  22. cnt1=abs(cnt1);
  23. cnt2=abs(cnt2);
  24. //cout<<tot<<endl;
  25. if(abs(cnt1-(tot-cnt1))>abs(cnt2-(tot-cnt2))) printf("%d\n", abs(cnt1-(tot-cnt1)));
  26. else (printf("%d\n", abs(cnt2-(tot-cnt2))));
  27. }
  28. return 0;
  29. }
Success #stdin #stdout 0s 3300KB
stdin
2
5 2
8 4 5 2 10
8 3
1 1 1 1 1 1 1 1
stdout
17
2