Codeforces 1312B Bogosort

传送门：Codeforces 1312B

---

B. Bogosort

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
input

3
1
7
4
1 1 3 5
6
3 2 1 5 6 4

output

7
1 5 1 3
2 4 6 1 3 5

---

解题思路：
将给的不等式换一下变成 j - i ≠ a_j - a_i ，那么因为 j-i>0,即递增，那么我们只要将给的序列降序排序一次，那么 a_j - a_i一定是小于 0 的。

AC代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
 
int t,n;
int a[110];
bool cmp(int a,int b)
{
  return a>b;
}
 
int main()
{
  scanf("%d",&t);
  while(t--)
  {
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
      scanf("%d",&a[i]);
    }
    if(n==1)
    {
      printf("%d\n",a[0]);
      continue;
    }
    sort(a,a+n,cmp);
    for(int i=0;i<n;i++)
    {
      printf("%d%c",a[i],i==n-1?'\n':' ');
    }
  }
  return 0;
}