Summary Files Commits Branches @commit @diff @stats
path: root / Year 2 / Design and analysis of algorithms / Practicum / Maycamp-175_Coaching_sort.cpp
blob: f3d21a53bcc9baaf03865f01bc49c6bfa75ee9d4 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <stdio.h>

int vals[200] = { 0 };
char input[10000010] = { '\0' };

int main() {
	int n;
	scanf("%d", &n);
	scanf("%s", input);
	for (int i = 0; i < n; i++) {
		vals[(int)input[i]]++;
	}

	int ii = 0;
	for (int i = '0'; i <= '9'; i++) {
		while (vals[i]-- > 0) {
			input[ii++] = i;
		}
	}
	for (int i = 'a'; i <= 'z'; i++) {
		while (vals[i]-- > 0) {
			input[ii++] = i;
		}
	}
	for (int i = 'A'; i <= 'Z'; i++) {
		while (vals[i]-- > 0) {
			input[ii++] = i;
		}
	}
	printf("%s\n", input);
}