[蓝桥杯2020年第十一届省赛真题-成绩分析] 不用排序做法

参考代码:

#include <bits/stdc++.h>

using namespace std;

const int N = 10010;

int a[N];

int main(void) {

    int n, sum = 0, max_s = -1, min_s = 101;

    cin >> n;

    for (int i = 0; i < n; i++) {

        scanf("%d", &a[i]);

        sum += a[i];

        max_s = max(max_s, a[i]);

        min_s = min(min_s, a[i]);

    }

    printf("%d\n%d\n%.2f", max_s, min_s, 1.0 * sum / n);

    return 0;

}