我也是一个蒟蒻,我只能告诉你,这道题其实不用排序。擂台法听过吗?
by gongchuqiao @ 2021-06-12 11:09:58
只要在每次输入后判断刚输入的这个数是否比之前看到的最大最小数大或小。举个例子,比如之前最大的数是6,这次输入的数是8,就把最大数更新为8。
附上[AC记录](https://www.luogu.com.cn/record/51708922)
by gongchuqiao @ 2021-06-12 11:14:08
把我的输入过程给你看下
```cpp
int max = -1;
int min = 11;
int sum = 0;
for (int i = 1;i <= n;i++)
{
int k;
scanf("%d", &k);
if (k > max)
max = k;
if (k < min)
min = k;
sum += k;
}
```
by gongchuqiao @ 2021-06-12 11:16:35
希望能帮到你
by gongchuqiao @ 2021-06-12 11:17:18