1038 Recover the Smallest Number (30 分)
注:贪心
#include#include #include #include using namespace std; const int maxn=10010; string z[maxn]; bool cmp(string a,string b) { return a+b>n; for (i=0;i >z[i]; sort(z,z+n,cmp); for (i=0;i

1038 Recover the Smallest Number (30 分)
注:贪心
#include#include #include #include using namespace std; const int maxn=10010; string z[maxn]; bool cmp(string a,string b) { return a+b>n; for (i=0;i >z[i]; sort(z,z+n,cmp); for (i=0;i