| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 363686 | 丁虞轩 | 【C5-8】01串排序 | C++ | Wrong Answer | 0 | 23 MS | 276 KB | 448 | 2025-11-28 19:20:50 |
#include<bits/stdc++.h> using namespace std; int n; string a[105]; int z(string a){ int s=0; for(int i=1;i<=n;i++){ if(a[i]==1)s++; } return s; } bool cmp(string x,string y){ if(x.size()!=y.size())return x.size()<y.size(); if(z(x)!=z(y))return z(x)<z(y); return x<y; } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } sort(a+1,a+n+1,cmp); for(int i=1;i<=n;i++){ cout<<a[i]<<endl; } return 0; }