1 solutions
-
0
Guest MOD
-
0
#include<bits/stdc++.h> using namespace std; struct node{ string x; int num; int lenx; }s[25]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ cin>>s[i].x; s[i].num=i; s[i].lenx=s[i].x.size(); } for(int i=1;i<=n;i++){ for(int j=1;j<i;j++){ if(s[i].lenx>s[j].lenx){ swap(s[i].lenx,s[j].lenx); swap(s[i].x,s[j].x); swap(s[i].num,s[j].num); } } } for(int i=1;i<=n;i++){ if(s[i].lenx==s[i+1].lenx){ if(s[i].x>s[i+1].x){ swap(s[i].lenx,s[i+1].lenx); swap(s[i].x,s[i+1].x); swap(s[i].num,s[i+1].num); } } } cout<<s[1].num<<endl; cout<<s[1].x; }
Information
- ID
- 787
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 7
- Tags
- (None)
- # Submissions
- 37
- Accepted
- 8
- Uploaded By