코딩테스트 백준 - 1015 수열정렬

#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

bool Compare(const int& lValue, const int& rValue)
{
	return lValue < rValue;
}

int main()
{
	int N;
	cin >> N;
	vector<int> v(N);
	vector<int> sorted(N);
	vector<bool> bIsSelected(N, false);

	for(int i = 0 ; i < N ; i++)
	{
		cin >> v[i];
		sorted[i] = v[i];
	}

	sort(sorted.begin(), sorted.end(), Compare);
	vector<int> answer;

	for(int i = 0 ; i < N ; i ++)
	{
		for(int j = 0 ; j < N ; j++)
		{
			if(v[i] == sorted[j])
			{
				if(bIsSelected[j] == false)
				{
					answer.emplace_back(j);
					bIsSelected[j] = true;
					break;
				}
			}
		}
	}
	answer.shrink_to_fit();

	for(int i = 0 ; i < N ; i++)
	{
		cout << answer[i] << " ";
	}
}