洛谷P1603 斯诺登的密码

https://www.luogu.org/problem/P1603

#include<bits/stdc++.h>
using namespace std;
struct s {
    string n;
    string t;
} pass[]= {
    {"one",""},{"two",""},{"three",""},{"four",""},{"five",""},{"six",""},{"seven",""},{"eight",""},{"nine",""},
    {"ten",""},{"eleven",""},{"twelve",""},{"thirteen",""},{"fourteen",""},{"fifteen",""},{"sixteen",""},{"seventeen",""},
    {"eighteen",""},{"nineteen",""},{"twenty",""},{"a",""},{"both",""},{"another",""},{"first",""},{"second",""},{"third",""}
};
string searchs( string  s) {
    for(int i=; i<; i++) {
        if(s==pass[i].n) {
            return pass[i].t;//在列表中查找是否存在，不存在返回00
        }
    }
    return "";
}
int main() {
    bool output=false; //专为第三点设置
    string str;
    string x[];
    for(int i=; i<; i++) {
        cin>>str;
        x[i]=searchs(str);
    }
    sort(x,x+);//利用string字典序的特性即可升序排序
    bool flag=false;//判断从哪里要开始输出0，什么时候不要输出0
    for(int i=; i<; i++) {
        if(x[i]=="")
            continue;
        if(x[i][]==''&&flag==false) {   //在最小数字判断第一位是否为0，如果是0，就直接输出第二位
            flag=true;   //标记    在以后遇到的数字都直接输出
        } else cout<<x[i][];
        cout<<x[i][];
        output=true;
    }
    if(!output)cout<<"";//整个过程中都没有输出最后补一个0
}