백준 1015 수열 정렬

//deque.tistory.com

#define _CRT_SECURE_NO_WARNINGS

#include <iostream> 
#include <vector> 
#include <algorithm>
#include <queue> 
#include <map>
#include <fstream> 
#include <string> 
#include <functional>
#include <limits.h>
#include <utility>
#include <cstring>

using namespace std;

vector<int> sortArr;
vector<int> prevArr;
vector<bool> isFill;

int main() {
	int N;
	scanf("%d", &N);
	int temp;
	for (int i = 0; i < N ; i++) {
		scanf("%d", &temp);
		sortArr.push_back(temp);
		prevArr.push_back(temp);
		isFill.push_back(false);
	}
	sort(sortArr.begin(), sortArr.end());
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			if (prevArr[i] == sortArr[j] && isFill[j] == false) {
				cout << j << " ";
				isFill[j] = true;
				break;
			}
		}
	}

	return 0;
}