Algorithm

[BOJ] 15688번 : 수 정렬하기 5

rudgh99_algo 2024. 8. 28. 22:08

1. problem : 

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

 

2. solution 1 :

#include <bits/stdc++.h>
using namespace std;
const int MXN = 2'000'000, HALF_MAX = MXN / 2; 
vector<int> isnum(MXN + 2);

int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0);

	
	int n, k;
	cin >> n; 

	while (n--) {
		cin >> k;
		isnum[k + HALF_MAX]++;
	}
	for (int i = 0; i <= MXN; i++) {
		while (isnum[i]--) {
			cout << i - HALF_MAX << '\n';
		}
	}
}