Submission #63018717

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
const int N=55;
struct node {
  int l;
  string s;
} a[N];
int n;
bool cmp(node n1,node n2) {
  return n1.l<n2.l;
}
int main() {
  cin>>n;
  for(int i=1;i<=n;i++) {
    cin>>a[i].s;
    a[i].l=a[i].s.size();
  }
  sort(a+1,a+n+1,cmp);
  for(int i=1;i<=n;i++) cout<<a[i].s;
  cout<<endl;
  return 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
const int N=55;
struct node {
	int l;
	string s;
} a[N];
int n;
bool cmp(node n1,node n2) {
	return n1.l<n2.l;
}
int main() {
	cin>>n;
	for(int i=1;i<=n;i++) {
		cin>>a[i].s;
		a[i].l=a[i].s.size();
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++) cout<<a[i].s;
	cout<<endl;
	return 0;
}

Submission Info

Judge Result