foj 1593 数字接力赛

用到 string的字符串连接

还有sort   sort的时间复杂度是nlogn

学习了

#include<iostream>#include<stdio.h>#include<string>#include<algorithm>#include<vector>using namespace std;#define N 100005int cmp(string a,string b){return a+b>b+a;}int main(){int n,i;char a[20];//string a;while(scanf("%d",&n)!=EOF){vector<string>s;for(i=0;i<n;i++){scanf("%s",a);//printf("%s\n",a);//cin>>a;s.push_back(a);//cout<<s[i]<<endl;}/*for(i=0;i<n;i++)cout<<s[i]<<endl;cout<<endl;*/sort(s.begin(),s.end(),cmp);for(i=0;i<n;i++)cout<<s[i];cout<<endl;}return 0;}