#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define inf 0x3f3f3f3f
const int mod=1e9+7;
const int N=2e5+5;
int n,m;
int a[N];
void solve(){
cin>>n;
priority_queue<int,vector<int>,greater<int>>q;
for(int i=1;i<=n;i++){
int x;
cin>>x;
q.push(x);
}
int sum=0,cnt=0;
while(q.size()>1){
int u=q.top();
q.pop();
u+=sum;
if(u>=0){
cnt+=u;
}
else{
sum+=u;
}
}
cout<<q.top()+sum+cnt<<endl;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int tt=1;
cin>>tt;
while(tt--) solve();
return 0;
}
显生之宙(思维)--牛客小白月赛89-B
最新推荐文章于 2024-10-10 22:59:02 发布