백준 한줄로 서기

https://www.acmicpc.net/problem/1138

1138번: 한 줄로 서기

음 쉽네요 대체 그전 실버 3문제 보다 더 쉬운데 ... ㅋㅋ 

#include <iostream>
#include <vector>
#include <queue>
#include<string>
#include<algorithm>
#include<cmath>
#include<unordered_map>
#include<map>
#include<stack>
using namespace std;

struct Point {
	int s, e, t, cnt, power;
	char c;
};

void Prints(vector<vector<int>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<bool>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j] << " ";
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<char>>maps, int n, int m) {
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << maps[i][j];
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<vector<vector<char>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}

void Prints(vector<vector<vector<bool>>>maps, int n, int m, int k) {
	for (int t = 0; t < k; t++) {
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				cout << maps[t][i][j];
			}
			cout << endl;
		}
		cout << endl;
	}
	cout << endl;
}
void Prints(vector<int>line, int n) {
	for (int i = 0; i < n; i++) {
		cout << line[i] << ",";
	}
	cout << endl;
}
void Prints(string str, int n) {
	for (int i = 0; i < n; i++) {
		cout << str[i] << ",";
	}
	cout << endl;
}

bool checkmaps(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m) {
	bool bCheck = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (maps[i][j] != anw[i][j]) {
				bCheck = true;
				i = n + 1;
				j = m + 1;
				continue;
			}
		}

	}
	return bCheck;

}
bool findstart(vector<vector<int>>maps, vector<vector<int>>anw, int n, int m, int) {
	bool bCheck = false;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			if (maps[i][j] != anw[i][j]) {
				bCheck = true;
				i = n + 1;
				j = m + 1;
				continue;
			}
		}

	}
	return bCheck;

}

struct Data {
	int index;
	int value;

};
struct GDatas {
	int change;
	int index;
	string times;

};
long long n, m;
int k, x;
vector<vector<int>>glistmaps;
vector<bool>bVisited;
bool cmp(const Data &a, const Data &b) {
	if (a.value == b.value) {
		return a.index < b.index;
	}
	return a.value < b.value;
}

int main() {
	
	int n;
	cin >> n;
	vector<Data>list;
	for (int i = 0; i < n; i++) {
		int tmp;
		cin >> tmp;
		Data d;

		d.index = i+1;//1,2,3,4
		d.value = tmp;//2 1 1 0
		list.push_back(d);
	}
	sort(list.begin(), list.end(), cmp);
	
	for (int i = 0; i < n; i++) {
		if (i != 0) {
			Data key = list[i];
			int cnt = 0;
			for (int j = i-1; j >= 0; j--) {
				
				if (key.index < list[j].index) {
					cnt++;
				}
			}

			if (cnt != key.value) {
				int change= cnt - key.value;//3 -1 =2 
				
				for (int j = i; j > i- change; j--) {
					Data tmp = list[j];//2-1;
					list[j] = list[j-1];
					list[j - 1] = tmp;
				}
			}
		}
	}

	for (int i = 0; i < n; i++) {
		cout << list[i].index << " ";
	}
	
	return 0;
}