Given a collection of number segments, you are supposed to recover the smallest number from them. For example, given {32, 321, 3214, 0229, 87}, we can recover many numbers such like 32-321-3214-0229-87 or 0229-32-87-321-3214 with respect to different orders of combinations of these segments, and the smallest number is 0229-321-3214-32-87.
Input Specification:
Each input file contains one test case. Each case gives a positive integer N (<=10000) followed by N number segments. Each segment contains a non-negative integer of no more than 8 digits. All the numbers in a line are separated by a space.
Output Specification:
For each test case, print the smallest number in one line. Do not output leading zeros.
解答:
最近我在看《演员的自我修养》,导演给“我们”讲述完了体验派表演艺术的整个体系,“我”科斯佳虽然喜爱这样的体系,但是不开心,因为“我”没有找到“我”想要的答案,那便是艺术的灵感从何而来。。。
在半个月前,这道题折腾了我好久,始终不得其解,今天再次看到题目时,不禁想如何使两个字符串连接起来最小呢,比如3219和321,觉得可以用a+b 和b+a比较的方法来求解,因为这种关系是符合测试用例的。所以我不禁试了一下,发现真的可以,最后只有一个用例错误,其他都正确,28分。嗯,可能这就是灵感吧。最后一个错,在于去掉开头的0,但如果字符串都是0,那么需要另外判定,输出0。终于AC!代码真的很简洁!!
AC代码如下:
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
#include<vector>
using namespace std;
bool isLower(const string& s1, const string& s2)
{
return (s1+s2 < s2+s1);
}
int main()
{
int N;
scanf("%d", &N);
vector<string> svec;
while(N--)
{
string s;
cin >> s;
svec.push_back(s);
}
sort(svec.begin(), svec.end(), isLower);
string result;
for(int i = 0; i < svec.size(); ++i)
{
result += svec[i];
}
//cout << result << endl;
int index = result.size();
for(int i = 0; i < result.size(); ++i)
{
if(result[i] != '0')
{
index = i; break;
}
}
if(index == result.size()) cout << "0" << endl;
else
{
cout << result.substr(index) << endl;
}
return 0;
}