D. Shocking Arrangement

Shocking Arrangement"/>

D. Shocking Arrangement

构造方法见代码

正确性：因为我们知道

 一定大于数组内的所有数，所以我们进行以下操作的时候每一次能得到的数也是严格小于

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1e9+7;
const int INF=0x3f3f3f3f;
const int N = 3e5+10;
int a[N];
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
void solve()
{int n;cin>>n;for(int i=1;i<=n;i++){cin>>a[i];}sort(a+1,a+1+n);if(a[n]==0){cout<<"No\n";return ;}int now=0;vector<int>ans;for(int i=1,j=n;i<=j;){if(now>0){now+=a[i];ans.push_back(a[i]);i++;}else{now+=a[j];ans.push_back(a[j]);j--;}}cout<<"Yes\n";for(auto it:ans){cout<<it<<" ";}cout<<endl;
}
signed main()
{int t;cin>>t;while(t--){solve();}
}