1312B - Bogosort - CodeForces Solution

constructive algorithms sortings *1000

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n=int(input())
    print(*sorted(list(map(int,input().split())))[::-1])

C++ Code: 

#include <bits/stdc++.h>
#define ll long long 
using namespace std;
int main ()
{
    ll T;
    cin >> T;
 
    while (T --){
        ll n;
        cin >> n;
 
        ll arr[n];
        for (ll i = 0; i < n; i ++){
            cin >> arr[i];
        }
 
        sort (arr , arr + n);
 
        for (ll i = n - 1; i >= 0; i --){
            cout << arr[i] << " ";
        }
 
        cout << endl;
    }
 
    return 0;
}


Comments

Submit
0 Comments
More Questions

1327B - Princesses and Princes
1450F - The Struggling Contestant
1399B - Gifts Fixing
1138A - Sushi for Two
982C - Cut 'em all
931A - Friends Meeting
1594A - Consecutive Sum Riddle
1466A - Bovine Dilemma
454A - Little Pony and Crystal Mine
2A - Winner
1622B - Berland Music
1139B - Chocolates
1371A - Magical Sticks
1253A - Single Push
706B - Interesting drink
1265A - Beautiful String
214A - System of Equations
287A - IQ Test
1108A - Two distinct points
1064A - Make a triangle
1245C - Constanze's Machine
1005A - Tanya and Stairways
1663F - In Every Generation
1108B - Divisors of Two Integers
1175A - From Hero to Zero
1141A - Game 23
1401B - Ternary Sequence
598A - Tricky Sum
519A - A and B and Chess
725B - Food on the Plane