Advertisement
Guest User

miniMaxSum

a guest
Nov 15th, 2019
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.54 KB | None | 0 0
  1. #include <stdio.h>
  2.  
  3. void miniMaxSum(long int *arr) {
  4. int p,k,u,q;
  5. long int a[5];
  6. long int max,min,sum=0;
  7. for(k=0;k<5;k++)
  8. {
  9. sum=sum+(arr[k]);
  10. }
  11. for(k=0;k<5;k++)
  12. {
  13. a[k]=sum-arr[k];
  14. }
  15. for(k=0;k<5;k++)
  16. {
  17. for(u=0;u<5;u++)
  18. {
  19. if((a[k]-a[u])<0)
  20. {break;
  21. }
  22. p=k;
  23. }
  24. }
  25.  
  26. for(u=0;u<5;u++)
  27. {
  28. for(k=0;k<5;k++)
  29. {if((a[k]-a[u])>0)
  30. {break;
  31. }
  32. q=k;
  33. }
  34. }
  35. printf("%ld %ld",(a[q]),(a[p]));
  36. }
  37. int main()
  38. {
  39. int i;
  40. long int arr[5];
  41. for(i=0;i<5;i++)
  42. {
  43. scanf("%ld",&arr[i]);
  44. }
  45. miniMaxSum(arr);
  46. return 0;
  47. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement