Cstudy_SimGyuLin/1_Lab08_2.c at master · 2023-FORZA/Cstudy_SimGyuLin · GitHub

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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <stdio.h>
#include <string.h>
#include <stdlib.h>

typedef struct {
	int kor;
	int eng;
	int math;
	char name[11];
}s;

s ar[100001];
s ar_copy[100001];

void merge(int start, int mid, int end) {
	int i = start;
	int j = mid + 1;
	int k = start;

	while (i <= mid && j <= end) {
		if (ar[i].kor > ar[j].kor) {
			ar_copy[k] = ar[i++];
		}
		else if (ar[i].kor < ar[j].kor) {
			ar_copy[k] = ar[j++];
		}
		else {
			if (ar[i].eng < ar[j].eng) {
				ar_copy[k] = ar[i++];
			}
			else if (ar[i].eng > ar[j].eng) {
				ar_copy[k] = ar[j++];
			}
			else {
				if (ar[i].math > ar[j].math) {
					ar_copy[k] = ar[i++];
				}
				else if (ar[i].math < ar[j].math) {
					ar_copy[k] = ar[j++];
				}
				else {
					if (strcmp(ar[i].name, ar[j].name) > 0) {
						ar_copy[k] = ar[j++];
					}
					else {
						ar_copy[k] = ar[i++];
					}
				}
			}
		}
		k++;
	}
	if (i > mid) {
		for (int m = j; m <= end; m++) {
			ar_copy[k++] = ar[m];
		}
	}
	else {
		for (int m = i; m <= mid; m++) {
			ar_copy[k++] = ar[m];
		}
	}
	for (int m = start; m <= end; m++) {
		ar[m] = ar_copy[m];
	}
}

void merge_sort(int start, int end) {
	if (start < end) {
		int mid = (start + end) / 2;
		merge_sort(start, mid);
		merge_sort(mid + 1, end);
		merge(start, mid, end);
	}
}

int main() {
	int n;
	scanf("%d", &n);

	for (int i = 0; i < n; i++) {
		scanf("%s %d %d %d", &ar[i].name, &ar[i].kor, &ar[i].eng, &ar[i].math);
	}
	merge_sort(0, n - 1);

	for (int i = 0; i < n; i++) {
		printf("%s\n", ar[i].name);
	}

	return 0;
}