Skip to content

Commit 3228cfc

Browse files
committed
Solution code for baekjoon/10989
1 parent fc4f9c9 commit 3228cfc

File tree

1 file changed

+29
-0
lines changed

1 file changed

+29
-0
lines changed

sorting/baekjoon/10989/solution.c

Lines changed: 29 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,29 @@
1+
#include <stdio.h>
2+
3+
int numbers[10001] = {0};
4+
5+
int main(void)
6+
{
7+
int n = 0;
8+
scanf("%d", &n);
9+
10+
int buffer = 0;
11+
for (int i = 0; i < n; i++)
12+
{
13+
scanf("%d", &buffer);
14+
numbers[buffer]++;
15+
}
16+
17+
for (int i = 0; i <= 10000; i++)
18+
{
19+
if (numbers[i] != 0)
20+
{
21+
for (int j = 0; j < numbers[i]; j++)
22+
{
23+
printf("%d\n", i);
24+
}
25+
}
26+
}
27+
28+
return 0;
29+
}

0 commit comments

Comments
 (0)