Codeforces Round #794 (Div. 2)/Codeforces Round #794 (Div. 1)(C./A. Circular Local MiniMax)

 

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int main()

{

    ll n,tst,ca=1;

    cin>>tst;

    while(tst--)

    {

        cin>>n;

        ll arr[n+6],ans[n+6],pos=1,flag=0;

        for(ll i=1; i<=n; i++)

            cin>>arr[i];

        sort(arr+1,arr+(n+1));

        if(n%2==1)

            for(ll i=1; i<=(n/2)+1; i++)

                ans[pos++]=arr[i],ans[pos++]=arr[i+(n/2)+1];

        else

            for(ll i=1; i<=(n/2); i++)

                ans[pos++]=arr[i],ans[pos++]=arr[i+(n/2)];

        ans[0]=ans[n],ans[n+1]=ans[1];///making neighbour for cycle

        for(ll i=1; i<=n; i++)

            if((ans[i-1]<=ans[i] && ans[i]<=ans[i+1]) || (ans[i-1]>=ans[i] && ans[i]>=ans[i+1]))

            {

                flag=1;

                break;

            }

        if(flag)

            cout<<"NO"<<endl;

        else

        {

            cout<<"YES"<<endl;

            for(ll i=1; i<=n; i++)

                cout<<ans[i]<<" ";

            cout<<endl;

        }

    }

    return 0;

}

///Alhamdulillah

 

Problem Link:https://codeforces.com/problemset/problem/1686/C