藍橋杯-數列特徵

問題描述

---

#include <stdio.h>
int main()
{
    int n,i,max = -10001,min = 10001,sum = 0;
    scanf("%d",&n);
    int a[n];
    for(i = 0 ; i < n ; i++)
    {
        scanf("%d",&a[i]);
        max = max < a[i]?a[i]:max;
        min = min > a[i]?a[i]:min;
        sum += a[i];
    }
    printf("%d\n",max );
    printf("%d\n",min );
    printf("%d\n",sum );
    return 0;
}