C45 [C]백준 12.정렬: 18870 백준 18870 내코드 #define _CRT_SECURE_NO_WARNINGS #include #include typedef struct _X { int x; int index; int result; } x; int compare_x(const void* first, const void* second) { x a = *(x*)first; x b = *(x*)second; if (a.x b.x) return 1; else return 0; } int compare_index(const void* first, const void* second) { x a = *(x*)first; x b = *(x*)second; if (a.index < b.ind.. 2022. 1. 25. [C]백준 12.정렬: 10814 백준 10814 내코드 #define _CRT_SECURE_NO_WARNINGS #include #include typedef struct _Person { int index; int age; char name[101]; } person; int compare(const void* first, const void* second) { person* a = (person*)first; person* b = (person*)second; if (a->age > b->age) return 1; else if (a->age age) return -1; else { if (a->index > b->index) return 1; else if (a->index index) return -1; els.. 2022. 1. 25. [C]백준 12.정렬: 1181 백준 1181 내코드 #define _CRT_SECURE_NO_WARNINGS #include #include int sorted[20001][51]; void merge(char list[][51], int left, int mid, int right) { int i, j, k, l; i = left; j = mid + 1; k = left; while (i 0) { strcpy(sorted[k++], list[j++]); } } } if (i > mid) { for (l = j; l 2022. 1. 25. [C]백준 12.정렬: 11651 백준 11651 내코드 #define _CRT_SECURE_NO_WARNINGS #include #define MAX_SIZE 100001 int sorted[MAX_SIZE][2]; int arr[100001][2]; void merge(int list[][2], int left, int mid, int right) { int i, j, k, l; i = left; j = mid + 1; k = left; while (i mid) { for (l = j; l y > b->y) return 1; else { if (a->x x) return -1; else return 1; } return 0; } int main() { int i, n; coord* list; scanf("%d", &n); l.. 2022. 1. 24. 이전 1 2 3 4 ··· 12 다음
