| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 119807 | 邓芷淇 | 矩阵排序 | C++ | Wrong Answer | 10 | 19 MS | 1216 KB | 447 | 2024-01-12 21:26:04 |
#include <iostream> #include<cstring> #include<algorithm> using namespace std; string a[505]; int main(){ int n,m; cin>>n>>m; getchar(); for(int i=1;i<=n;i++){ getline(cin,a[i]); } for(int i=1;i<=n-1;i++){ for(int j=1;j<=n-i;j++){ if(a[j].size()<a[j+1].size()) swap(a[j],a[j+1]); if(a[j].size()==a[j+1].size()&&a[j]>a[j+1]) swap(a[j],a[j+1]); } } for(int i=1;i<=n;i++){ cout<<a[i]<<endl; } return 0; }