寒假训练：Taurus's Trial B - 2

#include<iostream>
using namespace std;
#include<algorithm>
int main()
{
	int n;
	while (cin >> n)
	{
		int *p = new int[n];
		for (int i = 0; i < n; i++)
		{
			cin >> p[i];
		}
		int *q = new int[n];
		for (int i = 0; i < n; i++)
		{
			q[i] = p[i];
		}
		sort(p, p + n);
		for (int i = 0; i < n; i++)
		{
			for (int j = 0; j < n; j++)
			{
				if (p[i] == q[j]) cout << j+1 <<" ";
			}
		}
		delete[]p;
		delete[]q;
	}
}