石子合并问题(大水题)

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
int n;
int a[10001] = { 0 };
scanf_s("%d", &n);
for (int i = 1; i <=n; i++)
{
cin >> a[i];
}
sort(a+1, a + n+1);
int b = 0;
for (int i = n; i >1; i--)
{
a[i - 1] = a[i] + a[i - 1];
b = b + a[i - 1];
}
cout << b<<endl;
return 0;

}

山师acm1013

一个大水题

看题号这么靠前就知道啦

只需吧 石子从大到小排起来

然后从大到小相加即可