求解

P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G

关注我就给你发题解!
by XQpig @ 2021-07-22 16:42:11


@[王建琳2021](/user/513670) ,关注我就给你发题解!
by XQpig @ 2021-07-22 16:45:31


已找到AC方法 ```cpp #include<bits/stdc++.h> using namespace std; priority_queue<int>a; int main(){ int n; cin>>n; int tmp; for(int i=0;i<n;i++){ cin>>tmp; a.push(-1*tmp); } int ans=0; while(a.size()>1){ int x=-1*a.top(); a.pop(); int y=-1*a.top(); a.pop(); int o=x+y; a.push(-1*o); ans+=o; } cout<<ans<<endl; return 0; } ```
by 王建琳2021 @ 2021-07-22 20:53:55


@[xieqihangmzyc](/user/318960) 就这么喜欢被关注?
by 给予树 @ 2021-08-07 16:19:39


|