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