题解 | 最大的差

#include <stdio.h>
int cmp(const void *a, const void *b){
    return *(int *)a - *(int *)b;
}
int main() {
    int n;
    scanf("%d", &n);
    int shuzu[n];
    for (int i = 0; i < n; i++){
        int j;
        scanf("%d", &j);
        shuzu[i] = j;
    }
    qsort(shuzu, n, sizeof(int), cmp);
    int max = shuzu[n - 1];
    int min = shuzu[0];
    printf("%d", max - min);
    return 0;
}