Advertisement
Umme_nishat

algorithom 3

Jun 21st, 2020
72
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.57 KB | None | 0 0
  1. #include<stdio.h>
  2.  
  3. int main () {
  4.  
  5. int n,i,j,k,min,index,m,t,p,q,sum1,sum2;
  6. scanf("%d",&t);
  7. for( k=0; k<t; k++){
  8. scanf("%d %d",&n,&m);
  9. int ar[n];
  10. for(i=0; i<n; i++){
  11. scanf("%d",&ar[i]);
  12. }
  13. sum1=0,sum2=0;
  14.  
  15. for( i=0; i<n; i++){
  16. min = ar[i];
  17. index = -1;
  18. for(j=i+1; j<n; j++){
  19. if(ar[j] < min){
  20. min = ar[j];
  21. index = j;
  22. }
  23. }
  24. if(index != -1){
  25. ar[index] = ar[i];
  26. ar[i] = min;
  27. }
  28.  
  29. }
  30.  
  31. for( p=0; p<n-m; p++){
  32. sum2+=ar[p];
  33. }
  34. for(q=n-1; q>=m; q--){
  35. sum1+=ar[q];
  36. }
  37. printf("%d\n",sum1-sum2);
  38. }
  39. return 0;
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement