第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-667 多位数连接

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
char num[20][10001];
char tmp[10001];
 
int com(const void *a, const void *b)
{
  char *i = (char *)a, *j = (char *)b;
  while(*i != '\0' && *i == *j){
    i++, j++;
  }
  if(*i == '\0'){
    return *j - *(char *)b;
  }else if(*j == '\0'){
    return *(char *)a - *i;
  }else{
    return *j - *i;
  }
}
 
int main(int argc, char **argv)
{
  int i, j;
  int n;
  scanf("%d\n", &n);
  for(i = 0; i < n; i++){
    scanf("%s", num[i]);
  }
  for(i = 0; i < n; i++){
    for(j = i + 1; j < n; j++){
      if(com(num[i], num[j]) > 0){
        strcpy(tmp, num[i]);
        strcpy(num[i], num[j]);
        strcpy(num[j], tmp);
      }
    }
  }
  for(i = 0; i < n; i++){
    printf("%s", num[i]);
  }
  printf("\n");
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
//自定义排序函数
bool cmp(string a,string b)
{
    return a+b>b+a;//如果a+b>b+a，则把a排在前面，否则将b排在前面
}
int main()
{
    int n;
    cin>>n;
    string s[n];
    //获取n个正整数，存入字符串数组a中
    for (int i = 0; i < n; ++i)
    {
        cin>>s[i];
    }
    sort(s,s+n,cmp);
    for (int i = 0; i < n; ++i)
    {
        cout<<s[i];
    }
    return 0;
}

import java.io.*;
public class Main {
    public static void main(String[] args) throws IOException {
        InputStreamReader iin = new InputStreamReader(System.in);
        BufferedReader bin =  new BufferedReader(iin);
        int n = Integer.parseInt(bin.readLine());
        String s = bin.readLine();
        String strings[] = new String[n];
        strings = s.split(" ");
        int a=0,b=0,c=0,k=0,w=0;
        String temp = "";
        for(int i=0;i<n-1;i++){
            c=i;
            for(int j=i+1;j<n;j++){
                k=0;
                w=0;
                a=Integer.parseInt(strings[c].substring(k,k+1));
              //System.out.print("a="+a);
                b=Integer.parseInt(strings[j].substring(w,w+1));
               // System.out.print("b="+b);
                while(a==b){
                    if(k<strings[c].length()-1){
                        k++;
                        a=Integer.parseInt(strings[c].substring(k,k+1));
                    }
                    if(w<strings[j].length()-1){
                        w++;
                        b=Integer.parseInt(strings[j].substring(w,w+1));
                    }
                }
                if(a<b){
                    c=j;
                }
            }
            temp = strings[i];
            strings[i] = strings[c];
            strings[c]  = temp;
        }
        for(int i=0;i<n;i++){
            System.out.print(strings[i]);
        }
    }
}

n=int(input())
s=[i for i in input().split()]
for i in range(n):
    for j in range(i+1,n):
        if s[i]+s[j]<s[j]+s[j]:
            s[i],s[j]=s[j],s[i]
print(str(int(''.join(s))))