vijos笨笨的单词排序题解

#include<iostream>
#include<string>
using namespace std;
int main(){
    char b[26],a[200];
    string c[1010];
    string y[1010];
    int i,j,n,sn;
    gets(b);
    for (i=0;i<26;i++)
    a[b[i]]=i+'a';
    scanf("%d",&n);
    for (i=1;i<=n;i++){
        cin >> c[i];
        y[i]=c[i];
        for(j=0;j<c[i].length();j++)
        c[i][j]=a[c[i][j]];
    }
    scanf("%d",&sn);
    if(sn==1){
              for (i=1;i<=n-1;i++)
              for (j=i+1;j<=n;j++){
                  if(c[i]>c[j]){
                                swap(c[i],c[j]);
                                swap(y[i],y[j]);
                  }
              }
    }
    else{
         for (i=1;i<=n-1;i++)
         for (j=i+1;j<=n;j++){
             if(c[i]<c[j]){
                           swap(c[i],c[j]);
                           swap(y[i],y[j]);
             }
         }
    }
    for(i=1;i<=n;i++)
    cout<<y[i]+1-1<<endl;
    //while (1);
    return 0;
}