04 P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G
题目:
代码:
#include<iostream>
using namespace std;
#define M 10005int sa[M];
#include<algorithm>
int n;int main()
{int sum=0;cin>>n;for(int i=1;i<=n;i++){cin>>sa[i];}sort(sa+1,sa+n+1);int l=1;int r=n;while(l<r){sum+=(sa[l]+sa[l+1]);sa[l+1]+=sa[l];l++;for(int i=l;i<=n-1;i++){if(sa[i]>sa[i+1]){swap(sa[i],sa[i+1]);}else{break;}}}cout<<sum<<endl;
}