#include #include #include typedef struct { char wordbook[11]; int num; int len; }english; int compareword(const void* a, const void* b) { const english* wordA = (const english*)a; const english* wordB = (const english*)b; return strcmp(wordA->wordbook, wordB->wordbook); } int comparenum(const void* a, const void* b) { const english* numA = (const english*)a; const english* numB = (const english*)b; return (numB->num - numA->num); } int main() { int n, m, k = 0, wordnum = 0, length = 0, count = 1; char word[11]; english book[1000]; scanf("%d %d", &n, &m); for(int i = 0; i < n; i++) { scanf("%s", word); length = strlen(word); if(length >= m) { strcpy(book[wordnum].wordbook, word); book[wordnum].len = length; wordnum++; } } qsort(book, wordnum, sizeof(book[0]), compareword); /*for(int i = 0; i < wordnum; i++) { printf("word : %s len : %d count : %d\n", book[i].wordbook, book[i].len, book[i].num); }*/ for(int i = 0; i < wordnum - 1; i++) { if(strcmp(book[i].wordbook, book[i+1].wordbook) == 0) { count++; if(i == wordnum - 2) { book[i+1].num = count; } } else if(strcmp(book[i].wordbook, book[i+1].wordbook) != 0) { book[i].num = count; count = 1; if(i == wordnum - 2) { book[i+1].num = count; } } } qsort(book, wordnum, sizeof(book[0]), comparenum); /*for(int i = 0; i < wordnum; i++) { if(book[i].num < 1) break; printf("word : %s len : %d count : %d\n", book[i].wordbook, book[i].len, book[i].num); }*/ if(wordnum == 1) { printf("%s\n", book[0].wordbook); return 0; } while(book[k].num >= 1) { if(book[k].num == book[k+1].num) { if(book[k].len == book[k+1].len) { if(strcmp(book[k].wordbook, book[k+1].wordbook) < 0) { printf("%s\n", book[k].wordbook); k++; continue; } else if(strcmp(book[k].wordbook, book[k+1].wordbook) > 0) { strcpy(word, book[k].wordbook); strcpy(book[k].wordbook, book[k+1].wordbook); strcpy(book[k+1].wordbook, word); printf("%s\n", book[k].wordbook); k++; continue; } } else if(book[k].len > book[k+1].len) { printf("%s\n", book[k].wordbook); k++; continue; } else if(book[k].len < book[k+1].len) { strcpy(word, book[k].wordbook); strcpy(book[k].wordbook, book[k+1].wordbook); strcpy(book[k+1].wordbook, word); printf("%s\n", book[k].wordbook); k++; continue; } } else if(book[k].num > book[k+1].num) { printf("%s\n", book[k].wordbook); k++; continue; } } return 0; }

제출 #115745

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력: