C 解法, 执行用时: 1ms, 内存消耗: 268KB, 提交时间: 2020-12-13

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int comp(const void *a, const void *b){
    return strcmp(*(char**)a, *(char**)b);
}
int main(void){
    int len;
    int i, j;
    int n, k;
    char str[16];
    int cnt[128] = { 0 };
    while(scanf("%d", &n) == 1){
        int top = -1;
        char *pwords[n];
        char words[n][16];
        for(i = 0; i < n; ++i) scanf("%s", words[i]);
        scanf("%s", str);
        scanf("%d", &k);
        len = strlen(str);
        for(i = 0; i < n; ++i){
            if(len == strlen(words[i]) && strcmp(str, words[i])){
                char *p = words[i];
                for(j = 0; j < len; ++j){
                    ++cnt[str[j]];
                    --cnt[p[j]];
                }
                int add = 1;
                for(j = 0; j < len; ++j){
                    if(cnt[str[j]] || cnt[p[j]]){
                        cnt[str[j]] = 0;
                        cnt[p[j]] = 0;
                        if(add == 1) add = 0;
                    }
                }
                if(add) pwords[++top] = words[i];
            }
        }
        qsort(pwords, top+1, sizeof(char*), comp);
        printf("%d\n", top+1);
        if(k-1 <= top) printf("%s\n", pwords[k-1]);
    }
    return 0;
}

C 解法, 执行用时: 1ms, 内存消耗: 372KB, 提交时间: 2020-12-28

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void sortString(char str[], int length) {
	for (int i = 0; i < length - 1; i++) {
		for (int j = i + 1; j < length; j++) {
			if (str[i] > str[j]) {
				char temp = str[i];
				str[i] = str[j];
				str[j] = temp;
			}
		}
	}
}

int main() {
	int n;
	while (scanf("%d", &n) != EOF) {
		char dict[1000][50];
		for (int i = 0; i < n; i++) {
			scanf("%s", &dict[i]);
		}
		char target[50];
		scanf("%s", target);
		int targetIndex = 0;
		scanf("%d", &targetIndex);
		char res[1000][50];
		int targetLen = strlen(target);
		int resIndex = 0;
		for (int i = 0; i < n; i++) {
			if ((strlen(dict[i]) == targetLen) && strcmp(dict[i], target) != 0) {
				char tempTarget[50];
				char tempDict[50];
				strcpy(tempTarget, target);
				strcpy(tempDict, dict[i]);
				sortString(tempTarget, strlen(tempTarget));
				sortString(tempDict, strlen(tempDict));
				if (strcmp(tempDict, tempTarget) == 0) {
					strcpy(res[resIndex++], dict[i]);
				}
			}
		}
		for (int i = 0; i < resIndex; i++) {
			for (int j = i + 1; j < resIndex; j++)
			{
				if (strcmp(res[i], res[j]) > 0) {
					char temp[50];
					strcpy(temp, res[i]);
					strcpy(res[i], res[j]);
					strcpy(res[j], temp);
				}
			}
		}
		printf("%d\n", resIndex);
		if (resIndex >= 1 && targetIndex - 1 < resIndex) {
			printf("%s\n", res[targetIndex - 1]);
		}
	}

	return 0;
}