在线等
by Simonzhang03022007 @ 2020-02-08 13:24:11
~~优先队列它不香吗~~
by 丧黑福造 @ 2020-02-08 13:25:21
您看出来那块错了么
by Simonzhang03022007 @ 2020-02-08 13:26:29
这个思路就错了吧
by 丧黑福造 @ 2020-02-08 13:39:23
```cpp
#include<bits/stdc++.h>
using namespace std;
int n,a[10001],ans=0;
int main(){
scanf("%d",&n);
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
for(int i=1;i<n;i++){
sort(a+i,a+n+1);
ans+=a[i]+a[i+1];
a[i+1]+=a[i];
a[i]=999999999;
}
printf("%d",ans);
return 0;
}
```
看看这个，开O2优化就能过。
by 秦仁杰2006 @ 2020-02-08 17:19:22
如此简单
by 秦仁杰2006 @ 2020-02-08 17:20:51
@[Simonzhang03022007](/user/306834)
by 秦仁杰2006 @ 2020-02-08 17:21:12
谢谢@[秦仁杰2006](/user/315643)
by Simonzhang03022007 @ 2020-02-08 17:56:20