Skip to content

[hyodol] - '수 정렬하기3' 문제 풀이 제출합니다. #70

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
honux77 merged 1 commit into from
Jun 15, 2019
Merged

[hyodol] - '수 정렬하기3' 문제 풀이 제출합니다. #70

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
29 changes: 29 additions & 0 deletions 190613/hyodol/10989.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
// BOJ 10989 - 수 정렬하기 3
// Counting Sort
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
const int MAX = 10000;

int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);

int n;
cin >> n;

vector<int> count(MAX+1);
for (int i = 0; i < n; i++) {
int num;
cin >> num;
count[num]++;
}

for (int num = 0; num <= MAX; num++) {
if (count[num] == 0) continue;
while (count[num]--) cout << num << '\n';
}

return 0;
}