fork download
copy 
  1. #include <iostream>
  2. #include <cstdio>
  3. #include <algorithm>
  4. #include <cmath>
  5. using namespace std;
  6. int MODULUS(long int a)
  7. {
  8. 	if (a > 0)
  9. 		return a;
  10. 	else 
  11. 		return a * -1;
  12. }		
  13. int main(void) 
  14. {
  15. 	long int x, y, z, p, q, r, m, n;
  16. 	scanf ("%ld", &x);
  17. 	for (x; x > 0; --x)
  18. 	{
  19. 		scanf ("%ld%ld", &y, &z);
  20. 		long int a[y];
  21. 		for (p = 0; p < y; ++p)
  22. 		{
  23. 			scanf ("%ld", &a[p]);
  24. 		}
  25. 		sort (a, a + y - 1);
  26. 		q = 0;
  27. 		for (p = 0; p < z; ++p)
  28. 		{
  29. 			q = q + a[p];
  30. 		}
  31. 		r = 0;
  32. 		for (p = z; p < y; ++p)
  33. 		{
  34. 			r = r + a[p];
  35. 		}
  36. 		m = 0, n = 0;
  37. 		for (p = y - 1; p >= y - z; --p)
  38. 		{
  39. 			m = m + a[p];
  40. 		}
  41. 		for (p < y - z; p >= 0; --p)
  42. 		{
  43. 			n = n + a[p];
  44. 		}
  45. 		if (MODULUS(q - r) > MODULUS(m - n))
  46. 			printf ("%ld\n", MODULUS(q - r));
  47. 		else
  48. 			printf ("%ld\n", MODULUS(m - n));
  49. 	}
  50. 	return 0;
  51. }
Success #stdin #stdout 0s 3344KB
comments (?)
stdin
copy 
1
10 9 
1 2 3 4 5 6 7 8 9 10
stdout
copy 
53
https://ideone.com/LZnyKw
language:
C++14 (gcc 8.3)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!