B - Iroha Loves Strings (ABC Edition)

GitHub 跳转原题关系图返回列表

OJ: atcoder

题目 ID: abc042_b

难度:未知

标签:

日期: 2026-07-10 15:50

题意

思路

代码

cpp

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16/**
 * Author by Rainboy blog: https://rainboylv.com github: https://github.com/rainboylvx
 * rbook: -> https://rbook.roj.ac.cn  https://rbook2.roj.ac.cn
 * rainboy的学习导航网站: https://idx.roj.ac.cn
 * create_at: 2026-07-10 15:50
 * update_at: 2026-07-10 15:50
 */
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    return 0;
}

复杂度

总结

abc042_b B - Iroha Loves Strings (ABC Edition)

Problem Statement

Iroha has a sequence of N strings S_1, S_2, …, S_N. The length of each string is L. She will concatenate all of the strings in some order, to produce a long string. Among all strings that she can produce in this way, find the lexicographically smallest one. Here, a string s=s_1s_2s_3…s_n is lexicographically smaller than another string t=t_1t_2t_3…t_m if and only if one of the following holds:

There exists an index i(1≦i≦min(n,m)), such that s_j = t_j for all indices j(1≦j

约束

1 ≦ N, L ≦ 100
For each i, the length of S_i equals L.
For each i, S_i consists of lowercase letters.

输入格式

The input is given from Standard Input in the following format:

text

1
2
3
4
5N L
S_1
S_2
:
S_N

输出格式

Print the lexicographically smallest string that Iroha can produce.

输入输出样例 #1

输入 #1

text

1
2
3
43 3
dxx
axx
cxx

输出 #1

text

1axxcxxdxx

B - Iroha Loves Strings (ABC Edition)

目录

题意

思路

代码

复杂度

总结