The Full Counting Sort

problem id:--https://www.hackerrank.com/challenges/countingsort4

code:--

#include <bits/stdc++.h>

using namespace std;

#define ll   long long

#define      pii               std::pair<int,int>

#define      vi                std::vector<int>

#define      vll               std::vector<long long>

#define      mp(a,b)           make_pair(a,b)

#define      pb(a)             push_back(a)

#define sc(x)   scanf("%d",&x)

#define scll(x)   scanf("%lld",&x)

#define sc2(x,y)   scanf("%d%d",&x,&y)

#define sc3(x,y,z)   scanf("%d%d%d",&x,&y,&z)

#define     pf(x)   printf("%d ",x)

#define     pf2(x,y)   printf("%d %d ",x,y)

#define     pf3(x,y,z)   printf("%d %d %d ",x,y,z)

#define pfnl()   putchar('\n');

#define      each(it,s)        for(auto it = s.begin(); it != s.end(); ++it)

#define      rep(i, n)         for(int i = 0; i < (n); ++i)

#define rep2(i,j,n)   for(int i = j; i < (n); ++i)

#define      fill(a)           memset(a, 0, sizeof (a))

#define      sortA(v)          sort(v.begin(), v.end())

#define      sortD(v)          sort(v.begin(), v.end(), greater<auto>())

#define      X                 first

#define      Y                 second

#define debug(x) cerr<<"debug->"<<#x<<"::"<<x<<endl

#define debug2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n"

#define debug3(x,y,z) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n"

#define MOD 1000000007

int main() {

//std::ios::sync_with_stdio(false);

int n;

sc(n);

vector<int> arr(n);

vector<string> str(n);

vector<string> ans(n);

int hash[1000005]={0};

rep(i,n)    { sc(arr[i]); ++hash[arr[i]]; cin>>str[i];if(2*i<(n-1)) str[i]="-";  }

rep2(i,1,n) hash[i]+=hash[i-1];

for(int i=n-1;i>=0;--i)

    {

    ans[hash[arr[i]]-1]=str[i];

    --hash[arr[i]];

}

for(int i=0;i<n;++i)

    cout<<ans[i]<<" ";

return 0;

}