60分TLE求调
查看原帖
60分TLE求调
1365062
Deric456楼主2024/8/17 11:09
#include<iostream>
#include<queue>
using namespace std;
int main()
{
	long long dui1=0,dui2=0,strength=0;
	priority_queue<long long,vector<long long>,greater <long long>> que;
	long long n,x,n2;
	scanf("%lld",&n);
	n2=n;
	for(;n--;){
		scanf("%lld",&x);
		que.push(x);
	}
	for(;--n2;){
		dui1=que.top();que.pop();
		dui2=que.top();que.pop();
		strength+=(dui1+dui2);
		que.push(dui1+dui2);
	}
	printf("%lld",strength);
}
2024/8/17 11:09
加载中...