蒟蒻,求助QAQ

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

@[zhuoyiping1014](/user/796808) ```cpp #include<bits/stdc++.h> using namespace std; priority_queue <int,vector<int>, greater<int> > q; int n,num,ans; int main(){ scanf("%d",&n); for(int i=1;i<=n;i++){ scanf("%d",&num);//输入的是num,不是n q.push(num); } for(int i=1;i<n;i++){ int x=q.top(); ans+=x; q.pop(); int y=q.top(); ans+=y; q.pop(); q.push(x+y); } cout<<ans<<'\n'; return 0; } ``` 一个小细节错了
by Eirin_Yagokoro @ 2022-11-11 21:49:01


多谢大佬
by zhuoyiping @ 2022-11-12 13:45:25


|