1689B - Mystic Permutation - CodeForces Solution

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long ul;
typedef map<int,int> mii;
typedef pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<long long> vl;
typedef map<long long,long long> mll;
typedef pair<long long,long long> pl;

#define F first
#define pb push_back
#define S second
#define er erase    
#define in insert
#define NOO cout<<"NO"<<nl;
#define YES cout<<"YES"<<nl;
#define NL cout<<endl;
#define FORR(x,arr) for(auto& x:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forin(i, n) for (int i = int(n-1); i >= 0; i--)
#define fast cin.tie(0);cout.tie(0);ios::sync_with_stdio(0)
#define test freopen("input.in","r",stdin); freopen("output.in","w",stdout)


const int N = 2e5 + 55;
// const ll mod = 1e9 + 7;
const ll mod = 998244353;
const char nl = '\n';

ll fact[N];
ll x,y,n,l,r,p,m,h,k,ans,ans2,opt,mid;
ll mx=INT_MIN,mn=INT_MAX,sm;
bool ok;
ll b[N],c[N],a[N];

void solve(){
	cin>>n;
	forn(i,n)cin>>a[i];
	forn(i,n)b[i]=a[i];
	sort(a,a+n);
	if(n==1){
		cout<<-1<<nl;
		return;
	}
	forn(i,n-1) if(a[i]==b[i])swap(a[i],a[i+1]);
	if(a[n-1]==b[n-1])swap(a[n-1],a[n-2]);
	forn(i,n)cout<<a[i]<<" ";
	cout<<nl;
}   

int main()  
{
    fast;
    #ifndef ONLINE_JUDGE
        test; 
    #endif

    int Tc=1;
    cin >> Tc;
    while(Tc--){
        solve();
    }   

    return 0;
}