UVa-10152 ShellSort(模拟)

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;

char arr[210][85];
char aim[210][85];
int T, n, i, j;

int main(){
	scanf("%d", &T);
	while(T--){
		scanf("%d", &n);
		getchar();
		for(i=0;i<n;i++) /*输入待排数列*/
            gets(arr[i]);
        for(i=0;i<n;i++) /*输入目标数列*/
            gets(aim[i]);
        i=n-1;
        j=n-1;

		while(i>=0){
			if(!strcmp(arr[i], aim[j])){
				j--;
			}
			i--;
		}

		for(; j>=0; j--){
			printf("%s\n", aim[j]);
		}
		printf("\n");
	}
		
	return 0;
}

猜你喜欢

转载自blog.csdn.net/grimcake/article/details/77688578