一道贪心的题
大体思路就是直接按字典序排序就可以,之后模拟数数
一开始想复杂了,嘎嘎
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define MAXD 100 + 10
using namespace std;
struct Word{
char word[MAXD];
}write[MAXD];
bool cmp(Word p,Word q){
if(strcmp(p.word,q.word) > 0)
return true;
else
return false;
}
int Compare(char x[],char y[]){
int i;
for(i = 0; x[i] && y[i]; i++)
if(x[i] != y[i]) return i;
return i;
}
int main(){
int N;
scanf("%d",&N);
for(int Case = 1; Case <= N ;Case ++){
int n,Sum;
scanf("%d",&n);
for(int i = 0; i < n; i++)
scanf("%s",write[i].word);
sort(write, write + n,cmp);
Sum = strlen(write[0].word);
for(int i = 1;i < n;i++){
Sum +=strlen(write[i].word) - Compare(write[i].word,write[i - 1].word);
}
printf("%d\n",Sum);
for(int i = 0;i < n;i++)
printf("%s\n",write[i].word);
}
return 0;
}