1375 猴子偷桃2

yuanbao · 发表于 2023-4-9 08:42:03

#include<iostream>
#include<queue>
using namespace std;
int n,tmp,one,two,ans;
int main(){
priority_queue<int,vector<int>,greater<int>> q;
cin>>n;
for(int i = 0;i<n;i++){
      cin>>tmp;
      q.push(tmp);
}

while(q.size() > 1){
      one = q.top();
      q.pop();
      two = q.top();
      q.pop();
      ans += one + two;
      q.push(ans);
}
cout<<ans;
return 0;
}

tiger · 发表于 2023-4-9 08:44:06

字体太大

Jason1129 · 发表于 2023-4-9 09:03:58

满分10分，我给-10分

yuanbao · 发表于 2023-4-9 09:12:21

#include<iostream>
#include<queue>
using namespace std;
int n,tmp,one,two,ans;
int main(){
priority_queue<int,vector<int>,greater<int>> q;
cin>>n;
for(int i = 0;i<n;i++){
      cin>>tmp;
      q.push(tmp);
}

while(q.size() > 1){
      one = q.top();
      q.pop();
      two = q.top();
      q.pop();
      ans += one + two;
      q.push(ans);
}
cout<<ans;
return 0;
}