作业帮#include #include #include #include using namespace std;const int MAXN = 9;int N;string s[MAXN];int id[MAXN];bool cmp(int i,int j) { // 比较函数return s[i] + s[j] < s[j] + s[i];} void input() { // 输入函数int i;char str[109];scanf("%d",&N); /
来源：学生作业帮助网 编辑：作业帮 时间：2024/12/01 11:40:37
![#include #include #include #include using namespace std;const int MAXN = 9;int N;string s[MAXN];int id[MAXN];bool cmp(int i,int j) { // 比较函数return s[i] + s[j] < s[j] + s[i];} void input() { // 输入函数int i;char str[109];scanf(](/uploads/image/z/9856785-57-5.jpg?t=%23include+%23include+%23include+%23include+using+namespace+std%3Bconst+int+MAXN+%3D+9%3Bint+N%3Bstring+s%5BMAXN%5D%3Bint+id%5BMAXN%5D%3Bbool+cmp%28int+i%2Cint+j%29+%7B+%2F%2F+%E6%AF%94%E8%BE%83%E5%87%BD%E6%95%B0return+s%5Bi%5D+%2B+s%5Bj%5D+%3C+s%5Bj%5D+%2B+s%5Bi%5D%3B%7D+void+input%28%29+%7B+%2F%2F+%E8%BE%93%E5%85%A5%E5%87%BD%E6%95%B0int+i%3Bchar+str%5B109%5D%3Bscanf%28%22%25d%22%2C%26N%29%3B+%2F)
#include #include #include #include using namespace std;const int MAXN = 9;int N;string s[MAXN];int id[MAXN];bool cmp(int i,int j) { // 比较函数return s[i] + s[j] < s[j] + s[i];} void input() { // 输入函数int i;char str[109];scanf("%d",&N); /
#include
#include
#include
#include
using namespace std;
const int MAXN = 9;
int N;
string s[MAXN];
int id[MAXN];
bool cmp(int i,int j) { // 比较函数
return s[i] + s[j] < s[j] + s[i];
}
void input() { // 输入函数
int i;
char str[109];
scanf("%d",&N); // 读入字符串数目,C style,也可以直接cin>>N;
for (i = 0; i < N; i++) {
scanf("%s",str); // 读入字符串,C style,也可以直接cin>>s[i];
s[i] = str;
id[i] = i; // 标记字符串下标,用于排序
}
}
void solve() {
int i;
sort(id,id + N,cmp); // 基于下标的排序,字符串本身不被修改
for (i = 0; i < N; i++)
printf("%s",s[id[i]].c_str()); // 输出结果,C style,也可以直接cout
#include #include #include #include using namespace std;const int MAXN = 9;int N;string s[MAXN];int id[MAXN];bool cmp(int i,int j) { // 比较函数return s[i] + s[j] < s[j] + s[i];} void input() { // 输入函数int i;char str[109];scanf("%d",&N); /
如果s[i] + s[j] < s[j] + s[i];则返回“1”
如果s[i] + s[j] > s[j] + s[i];则返回“0”