Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- void miniMaxSum(long int *arr) {
- int p,k,u,q;
- long int a[5];
- long int max,min,sum=0;
- for(k=0;k<5;k++)
- {
- sum=sum+(arr[k]);
- }
- for(k=0;k<5;k++)
- {
- a[k]=sum-arr[k];
- }
- for(k=0;k<5;k++)
- {
- for(u=0;u<5;u++)
- {
- if((a[k]-a[u])<0)
- {break;
- }
- p=k;
- }
- }
- for(u=0;u<5;u++)
- {
- for(k=0;k<5;k++)
- {if((a[k]-a[u])>0)
- {break;
- }
- q=k;
- }
- }
- printf("%ld %ld",(a[q]),(a[p]));
- }
- int main()
- {
- int i;
- long int arr[5];
- for(i=0;i<5;i++)
- {
- scanf("%ld",&arr[i]);
- }
- miniMaxSum(arr);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement