不知道哪里错了

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

```cpp #include<cstdio> #include<queue> int a; using namespace std; int main() { priority_queue< int> q; int n; scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&a); q.push(-a); } int sum=0; while(q.size()>1) { int d=q.top(); q.pop(); int e=q.top(); q.pop(); int c=d+e; q.push(c); sum-=c; } printf("%d",sum); return 0; } ```
by FlyingAnt @ 2017-03-21 21:08:47


|