outputstandard output
You are given an array a1,a2,…,an. Array is good if for each pair of indexes i<j the condition j−aj≠i−ai holds. Can you shuffle this array so that it becomes good? To shuffle an array means to reorder its elements arbitrarily (leaving the initial order is also an option).
For example, if a=[1,1,3,5], then shuffled arrays [1,3,5,1], [3,5,1,1] and [5,3,1,1] are good, but shuffled arrays [3,1,5,1], [1,1,3,5] and [1,1,5,3] aren’t.
It’s guaranteed that it’s always possible to shuffle an array to meet this condition.
Input
The first line contains one integer t (1≤t≤100) — the number of test cases.
The first line of each test case contains one integer n (1≤n≤100) — the length of array a.
The second line of each test case contains n integers a1,a2,…,an (1≤ai≤100).
Output
For each test case print the shuffled version of the array a which is good.
Example
inputCopy
3
1
7
4
1 1 3 5
6
3 2 1 5 6 4
outputCopy
7
1 5 1 3
2 4 6 1 3 5
思路：很难相信这个题我想了这么久，最后是暴力做的。。
其实只要排序之后，倒序输出就好了，那样一定是互不相等的。==
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxx=1e2+10;
struct node{
int x,z;
bool operator<(const node &a)const{
return z<a.z;
}
}p[maxx];
int vis[maxx<<1];
int n;
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++) cin>>p[i].x;
int flag=1,i;
while(flag)
{
flag=0;
for(i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(i-p[i].x==j-p[j].x)
{
flag=1;
swap(p[i].x,p[j].x);
break;
}
}
if(flag) break;
}
}
for(int i=1;i<=n;i++) cout<<p[i].x<<" ";cout<<endl;
}
return 0;
}
努力加油a啊，(o)/~
