fork(1) download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. void quicksort(int a[],int L,int R)
  4. {
  5. 	int l=L,r=R,mid=(l+r)/2;
  6. 	while(l<r)
  7. 	{
  8. 		while(a[l]<a[mid]) l++;
  9. 		while(a[r]>a[mid]) r--;
  10. 	    if(l<=r)
  11. 	    {
  12. 	    	swap(a[l],a[r]);
  13. 	    	l++;r--;
  14. 		}
  15. 		if(l<R) quicksort(a,l,R);
  16. 		if(r>L) quicksort(a,L,r);
  17. 	}
  18. }
  19. int main()
  20. {
  21. 	int t;
  22. 	cin>>t;
  23. 	while(t--)
  24. 	{
  25. 		long long n,k;
  26. 		cin>>n>>k;
  27. 		long long m1=0;
  28. 		long long m2=0;
  29. 		int a[100]={};
  30. 		for(int i=0;i<n;i++)
  31. 		cin>>a[i];
  32. 		quicksort(a,0,n-1);
  33. 		for(int i=0;i<k;i++)
  34. 		m1+=a[i];
  35. 		for(int i=k;i<n;i++)
  36. 		m2+=a[i];
  37. 		if(m2>=m1) cout<<m2-m1<<endl;
  38. 		else cout<<m1-m2<<endl;
  39.  
  40. 	}
  41. }
  42.  
Success #stdin #stdout 0s 4240KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/gKzIIY
language:
C++ (gcc 8.3)
created:
5 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!