We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
- Prepare
- Algorithms
- Warmup
- Mini-Max Sum
- Discussions
Mini-Max Sum
Mini-Max Sum
Sort by
recency
|
5797 Discussions
|
Please Login in order to post a comment
or
My Solution.
#include
int mini(long long int a[]) { long long int min=a[0]; for(int i=1;i<5;i++) { if(a[i]max) { max=a[i]; } } return max; } int summ(long long int a[]) { long long int sum=0; for(int i=0;i<5;i++) { sum=sum+a[i]; } return sum; } int main() { long long int arr[5]; for(int i=0;i<5;i++) { scanf("%lld",&arr[i]); } long long int r=mini(arr); long long int k=maxi(arr); long long int sum=summ(arr); printf("%lld ",sum-k); printf("%lld",sum-r); return 0;
}
}