codechef/max_wt_diff.cpp at master · sdurgi17/codechef · GitHub

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
#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>

using namespace std;

long long int max_diff(long long int arr[], int n, int k ) {

	sort(arr, arr + n);
	reverse(arr, arr + n);

	long long int sum1 = 0;
	long long int sum2 = 0;
	if ( k >= n - k ) {
		for ( int i = 0; i < k; i++ )  {
			sum1 += arr[i];
		}

		for ( int i = k; i < n; i++ ) {
			sum2 += arr[i];
		}
	} else {
		for ( int i = 0; i < n - k; i++ ) {
			sum1 += arr[i];
		}

		for ( int i = n - k; i < n; i++ ) {
			sum2 += arr[i];
		}
	}

	return sum1 - sum2;
}

int main()
{

	int t;
	cin >> t;

	for ( int i = 0; i < t; i++ ) {

		int n;
		int k;

		cin >> n;
		cin >> k;

		long long int arr[n];

		for ( int j = 0; j < n; j++ ) {
			cin >> arr[j];
		}

		cout << max_diff(arr, n, k) << endl;
	}

	return 0;
}