Skip to main content

Mini-Max Sum Hackerrank Solution in C

#include<stdio.h>
int main()
{
int i,a[1000];
long int sum=0;
for(i=0;i<5;i++)
{
scanf("%d",&a[i]);
}
int max=a[0];
for(i=0;i<5;i++)
{
if(max<a[i])
{
max=a[i];
}
}
int min=a[0];
for(i=0;i<5;i++)
{
if(min>a[i])
{
min=a[i];
}
}
for(i=0;i<5;i++)
{
sum=sum+a[i];
}
printf("%ld %ld",sum-max,sum-min);
return 0;
}

Comments

Popular posts from this blog

Breaking the Records Hackerrank solution in C

#include< stdio.h > int main() { int n,i,a[ 1000 ],x= 0 ,mn= 0 ; scanf( "%d" ,&n); for (i= 0 ;i<n;i++) { scanf( "%d" ,&a[i]); } int min=a[ 0 ],max=a[ 0 ]; for (i= 0 ;i<n;i++) { if (min>a[i]) { min=a[i]; mn++; } } for (i= 0 ;i<n;i++) { if (max<a[i]) { max=a[i]; x++; } } printf( "%d %d" ,x,mn); return 0 ; }