1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n; string s[1001]; bool cmp(string s1,string s2) { if(s1.size()>s2.size()) return 1; if(s1.size()<s2.size()) return 0; for(int i=0;i<s1.size();i++) { if(s1[i]>s2[i]) return 1; if(s1[i]<s2[i]) return 0; } } int main() { cin>>n; for(int i=0;i<n;i++) cin>>s[i]; for(int i=n-1;i>0;i--) for(int j=0;j<i;j++) { string x1=s[j]+s[j+1]; string x2=s[j+1]+s[j]; if(cmp(x1,x2)==0) swap(s[j],s[j+1]); } for(int i=0;i<n;i++) cout<<s[i]; return 0; }
- 1
Information
- ID
- 783
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 10
- Tags
- # Submissions
- 2
- Accepted
- 0
- Uploaded By