Maximum_Number_Of_Distinct_Elements.cpp

//Maximum_Number_Of_Distinct_Elements
//https://www.codechef.com/SNCKQL21/problems/MAXDISTKT

//#include<bits/stdc++.h>

#include<vector>
//#include<queue>
//#include<stack>
//#include<set>
//#include<map>
//#include<unordered_set>
//#include<unordered_map>
//#include<deque>
//#include<utility>

//#include<priority_queue>

#include<iostream>
#include<algorithm>
//#include<string>
//#include<stdlib.h>
//#include<math.h>
//#include<time.h>
#include<climits>
//#include<cstdlib>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<ll> vl;
typedef vector<vl> vvl;

#define MAX INT_MAX
#define MIN INT_MIN
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second

// loop
#define fo(a, b, c) for (int(a) = (b); (a)<(c); ++(a))
#define foe(a, b, c) for (int(a) = (b); (a)<=(c); ++(a))
#define foge(a, b, c) for (int(a) = (b); (a)>=(c); --(a))
#define fosq(a, b, c) for (int(a) = (b); (a)*(a) <= (c); ++(a))

#define foc(a, b, c) for (char(a) = (b); (a)<(c); ++(a))
#define foce(a, b, c) for (char(a) = (b); (a)<=(c); ++(a))

#define foat(a, b) for (auto &(a) : (b))
#define foall(a, b) for (auto (a) : (b))
#define range(i, n) fo(i, 0, n)

// util
#define sqr(x) ((x) * (x))
#define minele(a) *min_element(all(a))
#define maxele(a) *max_element(all(a))
#define sum(a) accumulate(all(a), 0)



//driver code
int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int Test; cin >> Test;
    while(Test--) {
        //solution start

        int n; cin>>n;
        vii b(n);

        //srand((unsigned)time(NULL));
        //cout<<"b: ";
        range(i, n) {
            int temp; cin>>temp;
            //temp = (rand()%(n)) + 1;
            //cout<<temp<<" ";
            b[i].first = temp;
            b[i].second = i;
        }
        //cout<<"\n";

        sort(b.begin(), b.end());

        /*
        cout<<"b: ";
        for(int i=0; i<n; i++) {
            cout<<b[i].first<<" ";
        }
        cout<<"\n";
        */

        vi a(n, 0);
        int last=0, r=0;

        for(int i=0; i<n; i++) {
            //cout<<"b["<<i<<"].first = "<<b[i].first<<", b["<<i<<"].second = "<<b[i].second<<" and r = "<<r<<"\n";
            if(r < b[i].first) {
                a[b[i].second] = r;
                last = r;
                r++;
            }
            else {
                a[b[i].second] = last;
                //cout<<"else\n";
            }
        }

        //cout<<"a: ";
        range(i, n) {
            cout<<a[i]<<" ";
        }
        cout<<"\n";

        //solution end
    }

    return 0;
}