submission_id string | problem_id string | status string | code string | input string | output string | problem_description string |
|---|---|---|---|---|---|---|
s927158338 | p04044 | Accepted | import sys
def main():
input = sys.stdin.readline
N, L = map(int, input().split())
A = [input().strip() for _ in range(N)]
A = sorted(A)
return ''.join(A)
if __name__ == '__main__':
print(main())
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s684275436 | p04044 | Accepted | n,l=(int(x) for x in input().split())
mojil=[]
for i in range(n):
mojil.append(input())
mojil.sort()
for i in range(n):
print(mojil[i],end="")
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s047967599 | p04044 | Accepted | N, L = list(map(int, input().split()))
s = [input() for i in range(N)]
s.sort()
ans = ''
for i in s:
ans += i
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s589722632 | p04044 | Accepted | N, L = map(int, input().split())
S = []
A = ""
for i in range(N):
s = input()
S.append(s)
S.sort()
for i in S:
A += i
print(A) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s262297845 | p04044 | Accepted | n,l = map(int, input().split())
word = []
for i in range(n):
s = input()
word.append(s)
word.sort()
print(*word,sep="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s960907693 | p04044 | Accepted | n, l = map(int, input().split())
s = [input() for _ in range(n)]
ans = ""
s.sort()
for i in s:
ans += i
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s403980917 | p04044 | Accepted | n,l=map(int,input().split())
s=[]
for i in range(n):
s.append(input())
order=sorted(s)
ans=''.join(order)
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s992149526 | p04044 | Accepted | n,l=map(int,input().split())
d=[input() for i in range(n)]
d.sort()
ans=""
for i in d: ans+=i
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s247708952 | p04044 | Accepted | N, L = map(int,input().split())
S = [0 for i in range(N)]
for i in range(N):
S[i] = input()
S = sorted(S)
print (''.join(S)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s432567385 | p04044 | Accepted | N, L = map(int, input().split())
S = []
for i in range(N):
S.append(str(input()))
S = sorted(S)
print(''.join(S)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s528113595 | p04044 | Accepted | N, L = map(int, input().split())
input_list = [input() for i in range(N)]
sorted_list = sorted(input_list)
comb_str = "".join(sorted_list)
print(comb_str) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s028057063 | p04044 | Accepted | # -*- coding utf-8 -*-
n,l=map(int,input().split())
s=[]
for i in range(n):
X=str(input())
s.append(X)
f=sorted(s)
ans=''.join(f)
print(ans)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s899925817 | p04044 | Accepted | N, L = map(int, input().split())
SList = []
for i in range(N):
SList.append(input())
SList.sort()
ans = "".join(SList)
print(ans)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s806146298 | p04044 | Accepted | N, L = map(int, input().split())
SList = []
for i in range(N):
SList.append(input())
SList.sort()
ans =""
for i in range(N):
ans += SList[i]
print(ans)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s256898586 | p04044 | Accepted | #42
n, l = map(int, input().split())
a = []
for i in range(n):
a.append(input())
a = sorted(a)
ans = ""
for i in range(n):
ans += a[i]
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s935824521 | p04044 | Accepted | n, l = (int(_) for _ in input().split())
strings = []
for i in range(n):
strings.append(input())
strings.sort()
s=''
for i in strings:
s += i
print(s) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s973784665 | p04044 | Accepted | a,b=map(int, input().split())
a=[input() for i in range(a)]
a.sort()
print(''.join(a)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s346618387 | p04044 | Accepted | from sys import stdin
input1=stdin.readline().rstrip().split()
N=int(input1[0])
L=int(input1[1])
input=[]
for n in range(N):
input.append(stdin.readline().rstrip())
input.sort()
output=""
for i in range(len(input)):
output+=input[i]
print(output) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s686097178 | p04044 | Accepted | N,L =map(int,input().split())
s=sorted([input() for i in range(N)])
print(*s,sep="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s415548388 | p04044 | Accepted | n,l = map(int,input().split())
s = [input() for i in range(n)]
s = sorted(s)
print("".join(s)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s847867884 | p04044 | Accepted | n, l=map(int, input().split())
s=[input() for i in range(n)]
s.sort()
print("".join(s)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s616762944 | p04044 | Accepted | n,l=map(int,input().split())
s=[]
for i in range(n):s.append(input())
s.sort()
print(''.join(map(str,s))) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s885449689 | p04044 | Accepted | n,l=map(int,input().split())
arr=[input() for _ in range(n)]
arr=sorted(arr)
print("".join(arr)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s368773059 | p04044 | Accepted | N, L=map(int, input().split())
m_list=list(input() for i in range(N))
new_list=sorted(m_list)
print("".join(new_list))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s984607926 | p04044 | Accepted | N, L =map(int, input().split())
a =[input() for _ in range(N)]
a.sort()
print ("".join(a)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s145032814 | p04044 | Accepted | N,L=map(int,input().split())
N=[0]*N
for i in range(len(N)):
N[i]=input()
N_s=sorted(N)
print(''.join(N_s)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s751093038 | p04044 | Accepted | N, L = map(int, input().split())
str_list = sorted([input() for _ in range(N)])
print(''.join(str_list)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s538802075 | p04044 | Accepted | n,l = map(int,input().split())
s=[]
for i in range(n):
s.append(input())
ans=sorted(s)
print(''.join(ans))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s479317674 | p04044 | Accepted | nl = list(map(int, input().split()))
s = []
for i in range(0, nl[0]):
s.append(input())
s.sort()
print(''.join(s))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s781109682 | p04044 | Accepted | n,l=map(int,input().split())
s = []
for i in range(n):
s.append(input())
s = sorted(s)
print("".join(s))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s980849626 | p04044 | Accepted | N,L=map(int,input().split())
List=[]
for i in range(N):
List.append(input())
List.sort()
List="".join(List)
print(List) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s413216584 | p04044 | Accepted | # 一行目
n, l = map(int, input().split())
# 二行目以降
# for i in range(h):
lines = sorted([str(input()) for i in range(n)])
test = ""
for line in lines:
test += line
print(test)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s768331281 | p04044 | Accepted | N, L = map(int, input().split())
S = [input().rstrip() for _ in range(N)]
print(''.join(sorted(S))) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s369453983 | p04044 | Accepted | N, L = map(int, input().split())
S =[]
for _ in range(N):
S.append(input())
x = ''.join(sorted(S))
print(x)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s378051580 | p04044 | Accepted | n, _ = [int(_) for _ in input().split()]
words = []
for _ in range(n):
words.append(input())
print("".join(sorted(words))) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s599587133 | p04044 | Accepted | a, b = map(int, input().split())
letters = []
for i in range(a):
c = input()
letters.append(c)
letterss = sorted(letters)
mojiretsu = ''
for x in letterss:
mojiretsu += x
print (mojiretsu) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s819016500 | p04044 | Accepted | N, L = map(int, input().split())
s = [input() for i in range(N)]
s.sort()
print(*s, sep = "") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s527336023 | p04044 | Accepted | N, L = map(int, input().split())
s = [input() for i in range(N)]
s.sort()
ans = ""
for i in s:
ans += i
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s720826943 | p04044 | Accepted | # -*- coding utf-8 -*-
n,l=map(int,input().split())
s =[str(input()) for i in range(n)]
s.sort()
print(*s,sep="")
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s039326289 | p04044 | Accepted | n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print("".join(s)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s821767373 | p04044 | Accepted | n, l = map(int, input().split())
s = []
for _ in range(n):
s.append(input())
s.sort()
print("".join(s)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s431913111 | p04044 | Accepted | # -*- coding utf-8 -*-
n,s =map(int,input().split())
s = [str(input()) for i in range(n)]
s.sort()
print(*s, sep="")
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s037990384 | p04044 | Accepted | n,l=map(int,input().split())
a=[]
for i in range(n):
a.append(input())
for j in range(n):
for i in range(j):
if a[i]>a[j]:
b=a[i]
a[i]=a[j]
a[j]=b
for i in range(1,n):
a[0] += a[i]
print(a[0]) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s257641447 | p04044 | Accepted | N, L = map(int, input().split())
words = [input() for _ in range(N)]
words.sort()
ans = ''.join(words)
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s838940806 | p04044 | Accepted | N, L = map(int, input().rstrip().split())
S = [input() for _ in range(N)]
S.sort()
print(*S, sep="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s631004701 | p04044 | Accepted | def iroha_loves_strings(N: int, L: int, S: list) -> str:
return ''.join(sorted(S))
if __name__ == "__main__":
N = 0
N, L = map(int, input().split())
S = [input() for _ in range(N)]
ans = iroha_loves_strings(N, L, S)
print(ans)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s566720406 | p04044 | Accepted | N, L = map(int, input().split())
m = [input() for i in range(N)]
m.sort()
ans = ''
for i in range(N):
ans += m[i]
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s074507786 | p04044 | Accepted | N,L = map(int,input().split())
S = [input() for _ in range(N)]
S.sort()
res = ""
for i in S:
res += i
print(res) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s901469129 | p04044 | Accepted | # -*- coding:utf-8 -*-
N, L = map(int, input().split())
s = sorted([input() for i in range(N)])
for i in s:
print(i, end='')
print()
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s727556985 | p04044 | Accepted | n,l=input().split()
lists=[]
n=int(n)
for i in range (0,n):
lists.append(input())
lists.sort()
li=''.join(lists)
print(li) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s774160542 | p04044 | Accepted | n, l = map(int, input().split())
s = sorted([input() for i in range(n)])
print(*s,sep="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s916925667 | p04044 | Accepted | n, l = map(int, input().split())
a = [input() for i in range(n)]
a.sort()
for aa in a:
print(aa, end="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s739626428 | p04044 | Accepted | N,L=map(int, input().split())
l=[input() for i in range(N)]
l.sort()
print(*l,sep="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s847073651 | p04044 | Accepted | N, L = map(int, input().split())
S = []
for s in range(N):
S.append(input())
S = sorted(S)
print(''.join(S))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s667119286 | p04044 | Accepted | n,l=map(int,input().split())
A=[input() for i in range(n)]
A.sort()
ans=""
for j in range(n):
ans += A[j]
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s840379264 | p04044 | Accepted | line = input().split(sep=" ")
strnum= int(line[0])
len = int(line[1])
input_str=[]
for i in range(strnum):
line = input()
input_str.append(line)
for i in sorted(input_str):
print(i,end="")
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s653686055 | p04044 | Accepted | i,m = map(int,input().split(" "));
str_list=[];
for _ in range(i):
str_list.append(input());
str_list=sorted(str_list);
print("".join(str_list)); | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s393266422 | p04044 | Accepted | n,m=map(int,input().split())
hoge=[]
for i in range(n):
hoge.append(input())
hoge.sort()
for i in range(n):
print(hoge[i],end="")
print("") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s531659420 | p04044 | Accepted | n, l = map(int, input().split())
s = []
for i in range(n):
s.append(input())
s_sorted = sorted(s)
print("".join(s_sorted)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s529613505 | p04044 | Accepted | def main():
N, L = map(int, input().split())
S = []
strings = ""
for i in range(N):
S.append(input())
S.sort()
for j in S:
strings += j
print(strings)
main()
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s039538376 | p04044 | Accepted | N,L = map(int,input().split())
s =[]
for i in range(N):
s.append(input())
s.sort()
result = ''.join(s)
print(result) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s615908107 | p04044 | Accepted | n,l=map(int,input().split())
s=[]
for i in range(n):
s.append(input())
s.sort()
print("".join(s)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s488037791 | p04044 | Accepted | N,b = map(int, input().split())
a = []
for i in range(N):
d = input()
a.append(d)
g = sorted(a)
print(''.join(g)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s939906577 | p04044 | Accepted | from sys import stdin
input = stdin.readline
N, L = [int(x) for x in input().rstrip().split()]
S = [input().rstrip() for _ in range(N)]
S.sort()
print("".join(S)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s415227642 | p04044 | Accepted | m,l = map(int,input().split())
s = sorted([input() for i in range(m)])
print(*s, sep="") | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s335456771 | p04044 | Accepted | N, L = list(map(int, input().split()))
words = ['']*N
for i in range(N):
words[i] = input()
words.sort()
ans = ''
for word in words:
ans += word
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s061441411 | p04044 | Accepted | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
mod = 1000000007
#A
"""
a = LI()
i = a.count(5)
j = a.count(7)
if i == 2 and j == 1:
print("YES")
else:
print("NO")
"""
#B
n,l = LI()
s = SR(n)
s.sort()
for i in s:
for j in i:
print(j,end = "")
print()
#C
"""
def check(n):
n = list(map(int,list(str(n))))
s = 0
for i in n:
s += f[i]
return s == 0
n,k = LI()
d = LI()
f = [0 for i in range(10)]
for i in d:
f[i] = 1
while 1:
if check(n):
print(n)
quit()
n += 1
"""
#D
"""
def f(x,y):
return fact[x-1+h-y]*fact[y-1+w-x]*inv_fact[x-1]*inv_fact[y-1]*inv_fact[w-x]*inv_fact[h-y]%mod
h,w,a,b = LI()
fact = [1]*(h+w+1)
for i in range(h+w):
fact[i+1] = fact[i]*(i+1)%mod
inv_fact = [0]*(h+w+1)
inv_fact[h+w] = pow(fact[-1],mod-2,mod)
for i in range(h+w)[::-1]:
inv_fact[i] = inv_fact[i+1]*(i+1)%mod
ans = 0
for i in range(1,min(w-b,h-a)+1):
ans += f(b+i,a+i)
ans %= mod
print(ans)
"""
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s502051225 | p04044 | Accepted | from functools import reduce
def main():
# 一文字のみを読み込み
# s = input().rstrip().split(' ')
# スペース区切りで標準入力を配列として読み込み
# s = input().rstrip().split(' ')
# 位置文字ずつ標準入力を配列として読み込み
# s = list(input().rstrip())
slist = input().rstrip().split(' ')
N = int(slist[0])
L = int(slist[1])
S = []
ans = ''
for i in range(0,N):
S.append(input().rstrip())
S.sort()
for i in range(0,N):
ans = ans + S[i]
print(ans)
if __name__ == '__main__':
main()
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s798233923 | p04044 | Accepted | N, L = map(int, input().split())
Sn = [input() for _ in range(N)]
print("".join(sorted(Sn)))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s226469425 | p04044 | Accepted | N, L= map(int,input().split())
data = sorted([input() for i in range(N)])
print("".join(data))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s512669073 | p04044 | Accepted | input_list = input().split()
N = int(input_list[0])
wordList = list()
for i in range(0,N):
wordList.append(input())
wordList = sorted(wordList)
answer = ""
for i in range(0,N):
answer = answer + wordList[i]
print(answer) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s804272131 | p04044 | Accepted | def main():
N,L = map(int,input().split())
S = []
for _ in range(N):
S.append(input())
S.sort()
for i in range(N):
print(S[i], end='')
if __name__ == '__main__':
main() | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s763415227 | p04044 | Accepted | n, l = (int(i) for i in input().split())
s = "".join(sorted([input() for i in range(n)]))
print(s)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s675660706 | p04044 | Accepted | N, L = list(map(int, input().split()))
S = [input() for i in range(N)]
S.sort()
for s in S:
print(s, end='') | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s648778276 | p04044 | Accepted | N, L = map(int, input().split())
data = sorted([input() for i in range(N)])
print(''.join(data)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s388225285 | p04044 | Accepted | N,L = map(int,input().split())
Ss = [input() for s in range(N)]
Ss.sort()
print("".join(Ss)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s329477024 | p04044 | Accepted | def main():
N, L = map(int, input().split())
S = [input() for _ in range(N)]
S.sort()
print("".join(S))
if __name__ == "__main__":
main()
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s075073050 | p04044 | Accepted | N, L = map(int, input().split())
char_list = []
for dummy in range(N):
S = str(input())
char_list.append(S)
char_list = sorted(char_list)
answer = ""
for char in char_list:
answer += char
print(answer) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s208831494 | p04044 | Accepted | n,l=map(int,input().split())
ans=[]
for i in range(n):
s=input()
ans.append(s)
ans.sort()
print("".join(ans)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s860512561 | p04044 | Accepted | n,l=map(int,input().split())
ans=[]
for i in range(n):
s=list(input())
ans.append(s)
ans.sort()
answer=""
for i in ans:
p="".join(i)
answer+=p
print(answer) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s865678238 | p04044 | Accepted | N, L = map(int, input().split())
S = sorted([input() for x in range(N)])
print("".join(S))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s435422857 | p04044 | Accepted | N, L = map(int, input().split())
S = [str(input()) for i in range(N)]
S.sort()
for i in S:
print(i, end='')
print()
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s653934665 | p04044 | Accepted | N, L = map(int, input().split())
all_list = []
for i in range(N):
S = input()
all_list.append(S)
all_list.sort()
out_word = ''
for word in all_list:
out_word = out_word + word
print(out_word) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s311710819 | p04044 | Accepted | n,l = map(int,input().split())
w = [input() for i in range(n)]
w = sorted(w)
ans = ''
for i in range(n):
ans += w[i]
print(ans) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s828881134 | p04044 | Accepted | n,l = map(int, input().split())
print(''.join(sorted([input() for _ in '1'*n]))) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s034932177 | p04044 | Accepted | n,l = map(int, input().split())
s = [input() for _ in '1'*n]
print(''.join(sorted(s))) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s982294364 | p04044 | Accepted | N, L = map(int, input().split())
nums = sorted([input() for i in range(N)])
print(''.join(nums)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s448444963 | p04044 | Accepted | # coding: UTF-8
N, _ = map(int, input().split())
strs = []
for _ in range(N):
strs.append(input())
strs.sort()
print(''.join(strs))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s785696010 | p04044 | Accepted | #!/usr/bin/env python3.4
# -*- coding: utf-8 -*-
# abc042_b
# input
N, L = map(int, input().split())
S = [input() for _ in range(N)]
# getans
ans = sorted(S)
# output
print(*ans, sep='')
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s531573856 | p04044 | Accepted | #!/usr/bin/env python3.4
# -*- coding: utf-8 -*-
# abc042_b
# input
N, L = map(int, input().split())
S = [input() for _ in range(N)]
# getans
ans = ''.join(sorted(S))
# output
print(ans)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s622987510 | p04044 | Accepted | n,m=map(int,input().split())
s=''
a=[input()for i in range(n)];a.sort()
for i in range(n):s+=a[i]
print(s) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s341150768 | p04044 | Accepted | N, L = list(map(int, input().split()))
S = [input() for i in range(N)]
Ss = sorted(S)
print(''.join(Ss))
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s257062133 | p04044 | Accepted | N, L = list(map(int, input().split()))
S = []
for i in range(N):
S.extend(list(map(str, input().split())))
S = ''.join(sorted(S))
print(S)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s739545307 | p04044 | Accepted | N,L=map(int,input().split())
S=[]
for i in range(N):
S.append(input())
S=sorted(S)
ans=""
for i in S:
ans= ans+i
print(ans)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s287403268 | p04044 | Accepted | N,L=map(int,input().split(' '))
print(''.join(sorted([input() for i in range(N)]))) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s139508058 | p04044 | Accepted | # -*- coding: utf-8 -*-
def main():
n, l = map(int, input().split())
s = [input() for _ in range(n)]
s.sort()
print(''.join(s))
if __name__ == '__main__':
main()
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s611394755 | p04044 | Accepted | n, l = map(int, input().split())
list = [input() for i in range(n)]
list.sort()
print(''.join(list)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s814892834 | p04044 | Accepted | N, L = map(int, input().split())
S = [input() for _ in range(N)]
S.sort()
print(''.join(S)) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s305661681 | p04044 | Accepted | n,l=map(int,input().split())
list=[]
for i in range(n):
list.append(input())
list.sort()
word=""
for i in list:
word+=i
print (word) | 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
s178658682 | p04044 | Accepted | n,l = map(int, input().split())
a = [input() for i in range(n)]
b = sorted(a)
k = ""
for j in range(n):
k = k+b[j]
print(k)
| 3 3
dxx
axx
cxx
| axxcxxdxx
| <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Iroha has a sequence of <var>N</var> strings <var>S_1, S_2, ..., S_N</var>. The length of each string is <var>L</var>.</p>
<p>She will concatenate all of the strings in some order, to produce a long string.</p>
<p>Among all strings that she can produce in this way, find the lexicographically smallest one.</p>
<p>Here, a string <var>s=s_1s_2s_3</var>...<var>s_n</var> is <em>lexicographically smaller</em> than another string <var>t=t_1t_2t_3</var>...<var>t_m</var> if and only if one of the following holds:
<ul>
<li>There exists an index <var>i(1≦i≦min(n,m))</var>, such that <var>s_j = t_j</var> for all indices <var>j(1≦j<i)</var>, and <var>s_i<t_i</var>.</li>
<li><var>s_i = t_i</var> for all integers <var>i(1≦i≦min(n,m))</var>, and <var>n<m</var>.</li>
</ul></p>
</section>
</div>
<div class="part">
<section>
<h3>Constraints</h3><ul>
<li><var>1 ≦ N, L ≦ 100</var></li>
<li>For each <var>i</var>, the length of <var>S_i</var> equals <var>L</var>.</li>
<li>For each <var>i</var>, <var>S_i</var> consists of lowercase letters.</li>
</ul>
</section>
</div>
<hr/>
<div class="io-style">
<div class="part">
<section>
<h3>Input</h3><p>The input is given from Standard Input in the following format:</p>
<pre><var>N</var> <var>L</var>
<var>S_1</var>
<var>S_2</var>
:
<var>S_N</var>
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Output</h3><p>Print the lexicographically smallest string that Iroha can produce.</p>
</section>
</div>
</div>
<hr/>
<div class="part">
<section>
<h3>Sample Input 1</h3><pre>3 3
dxx
axx
cxx
</pre>
</section>
</div>
<div class="part">
<section>
<h3>Sample Output 1</h3><pre>axxcxxdxx
</pre>
<p>The following order should be used: <code>axx</code>, <code>cxx</code>, <code>dxx</code>.</p></section>
</div>
</span> |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.