#define _CRT_SECURE_NO_WARNINGS #include #include typedef struct { char str[51]; int strLen; } StrWithLen; void merge(StrWithLen* arr, StrWithLen* temp, int left, int mid, int right) { int leftIndex = left; int rightIndex = mid + 1; int mergeIndex = left; while (leftIndex <= mid && rightIndex <= right) { if (arr[leftIndex].strLen < arr[rightIndex].strLen) { temp[mergeIndex++] = arr[leftIndex++]; } else if (arr[leftIndex].strLen > arr[rightIndex].strLen) { temp[mergeIndex++] = arr[rightIndex++]; } else { int i = 0; for (; i < arr[leftIndex].strLen; i++) { if (arr[leftIndex].str[i] < arr[rightIndex].str[i]) { temp[mergeIndex++] = arr[leftIndex++]; break; } if (arr[leftIndex].str[i] > arr[rightIndex].str[i]) { temp[mergeIndex++] = arr[rightIndex++]; break; } } if (i == arr[leftIndex].strLen) { temp[mergeIndex++] = arr[leftIndex++]; temp[mergeIndex++] = arr[rightIndex++]; } } } // 나머지 while (leftIndex <= mid) { temp[mergeIndex++] = arr[leftIndex++]; } while (rightIndex <= right) { temp[mergeIndex++] = arr[rightIndex++]; } // temp -> arr 이동 for (int i = left; i <= right; i++) { arr[i] = temp[i]; } } void mergeSort(StrWithLen* arr, StrWithLen* temp, int left, int right) { if (left >= right) return; int mid = (left + right) / 2; mergeSort(arr, temp, left, mid); mergeSort(arr, temp, mid + 1, right); merge(arr, temp, left, mid, right); } int main() { int N; scanf("%d", &N); StrWithLen* arr = (StrWithLen*)malloc(sizeof(StrWithLen) * N); StrWithLen* temp = (StrWithLen*)malloc(sizeof(StrWithLen) * N); for (int i = 0; i < N; i++) { scanf("%s", arr[i].str); } for (int i = 0; i < N; i++) { int j = 0; while (arr[i].str[j] != '\0') { j++; } arr[i].strLen = j; } mergeSort(arr, temp, 0, N - 1); printf("%s\n", arr[0].str); for (int i = 1; i < N; i++) { if (arr[i].strLen != arr[i - 1].strLen) { printf("%s\n", arr[i].str); } else { for (int j = 0; j < arr[i].strLen; j++) { if (arr[i].str[j] != arr[i - 1].str[j]) { printf("%s\n", arr[i].str); break; } } } } free(arr); free(temp); }

제출 #92605

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: