题解 | 字符串排序

//
// Created by gs on 2026/3/5.
//

// HJ14

#include <stdio.h>
#include <string.h>
typedef struct {
    char word[102];
} AAA;

int main() {
    int n, i, j;
    AAA dan[1001];

    memset(dan, 0, sizeof (dan));


    scanf("%d", &n);

    i = 0;
    while (scanf("%s", dan[i].word) != EOF) { // 注意 while 处理多个 case
        i++;
        if (i == n)
            break;
    }

    for (i = 0; i < n; i++) {
        char* min = dan[i].word;
        for (j = i + 1; j < n; j++) {
            if (strcmp(min, dan[j].word) > 0) {
                min = dan[j].word;
            }
        }

        char temp[102] = {0};
        strcpy(temp, dan[i].word);
        strcpy(dan[i].word, min);
        strcpy(min, temp);
    }

    for (i = 0; i < n; i++) {
        printf("%s\n", dan[i].word);
    }
    return 0;
}