zoukankan      html  css  js  c++  java
  • codeforces 632C C. The Smallest String Concatenation(sort)

    C. The Smallest String Concatenation
    time limit per test
    3 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    You're given a list of n strings a1, a2, ..., an. You'd like to concatenate them together in some order such that the resulting string would be lexicographically smallest.

    Given the list of strings, output the lexicographically smallest concatenation.

    Input

    The first line contains integer n — the number of strings (1 ≤ n ≤ 5·104).

    Each of the next n lines contains one string ai (1 ≤ |ai| ≤ 50) consisting of only lowercase English letters. The sum of string lengths will not exceed 5·104.

    Output

    Print the only string a — the lexicographically smallest string concatenation.

    Examples
    input
    4
    abba
    abacaba
    bcd
    er
    output
    abacabaabbabcder
    input
    5
    x
    xx
    xxa
    xxaa
    xxaaa
    output
    xxaaaxxaaxxaxxx
    input
    3
    c
    cb
    cba
    output
    cbacbc
    题意:给你n个字符串,输出字典序最小的排序;
    思路:写个比较函数cmp(),sort一下再输出就好了;
    AC代码:
    #include <bits/stdc++.h>
    using namespace std;
    const int N=1e4+4;
    string str[6*N];
    int n;
    int cmp(string x,string y)
    {
       return x+y<y+x;
    }
    int main()
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++)
        {
            cin>>str[i];
        }
        sort(str,str+n,cmp);
        for(int i=0;i<n;i++)
        {
            cout<<str[i];
        }
        return 0;
    }
  • 相关阅读:
    paraview将csv格式显示为云图
    Valgrind安装与使用
    vscode+WSL+Debug+Cmake+OpenGL
    MFiX中DEM颗粒信息随时间变化
    origin添加两个Y轴
    conda回滚
    onedrive同步其他任意文件夹
    MFiX-DEM中的并行碰撞搜索
    MFiX-DEM中的串行碰撞搜索
    【Go】四舍五入在go语言中为何如此困难
  • 原文地址:https://www.cnblogs.com/zhangchengc919/p/5236602.html
Copyright © 2011-2022 走看看