Mini-Max Sum

Mini-Max Sum from Hackerrank.com
https://www.hackerrank.com/challenges/mini-max-sum/problem
[restrict …]

#include<stdio.h>
#include <stdlib.h>
void miniMaxSum(int arr_count, int* arr);
int main()
{
    long long int a[] = {1,2,3,4,5};
    int size;
    size = (sizeof(a))/sizeof(a[0]);
    miniMaxSum(size,a);
    return 0;
}
void miniMaxSum(int arr_count, int* arr)
{
    long long int s = 0;
    int c=0,j;
    long long int t;
    long long int *a = NULL;
    a = (long long int*)malloc(sizeof(long long int)*arr_count);
    int i;
    for(i=0;i<arr_count;i++)
    {
        s = 0;
        for(j=0;j<arr_count;j++)
        {
            if(j != i)
                s=s+arr[j];
        }
        a[c++] = s;
    }
    for(i=0;i<c;i++)
    {
        for(j=i+1;j<c;j++)
        {
            if(a[i] > a[j])
            {
                t=a[i];
                a[i]=a[j];
                a[j]=t;
            }
        }
    }
    printf("%lld %lld",a[0],a[c-1]);
}

[/restrict]