C.Sort it out! | Editorial by Uvaish

C.Sort it out! | Editorial by Uvaish_Zafri

So, here we are given an integer 'N' denoting the size of array followed by N space separated integers. And we need to find the original position of individual elements in sorted array.
let's understand it with few examples:

**Ex 1**:
Input:
**5
4 5 3 7 1**
OUTPUT:**4 2 0 1 3** / sorted array is **"1 3 4 5 7" **and the original positions of the individual elements before sorting were given in output sequentially/

So, for solving this problem we need to have something that **stores element values as well as there original positions at one place**.
For this we can use vector of pair where each **pair represent element value and original position of the element**.
Now just **sort the vector based on element value and print the original position of all the elements**.

So, now let's code it in CPP :)

```
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define foi(n) for(ll i=0;i<n;i++)

int main() {
   
    ll n;
    cin>>n;

vector<pair<ll,ll>> v(n);
    foi(n){
        cin>>v[i].first;
        v[i].second=i;
    }

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

foi(n)
        cout<<v[i].second<<" ";

return 0;
}
```

C.Sort it out! | Editorial by Uvaish_Zafri

Download submission

All caught up!

View submission

Is your resume even shortlisted?