1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n; struct fj { string name; int size1,shuxu; }a[100005]; bool cmp(fj a,fj b) { if(a.size1!=b.size1)return a.size1>b.size1; else return a.shuxu<b.shuxu; } int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i].name; a[i].size1=a[i].name.size(); a[i].shuxu=i; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++) cout<<a[i].name<<endl; return 0; }
- 1
Information
- ID
- 16928
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By