01串排序

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
struct cmp
{
    bool operator()(const string &s1,const string &s2)
    {
        if(s1.length()!=s2.length())return s1.length()<s2.length();
        int c1=count(s1.begin(),s1.end(),‘1‘);
        int c2=count(s2.begin(),s2.end(),‘1‘);
        return (c1!=c2?c1<c2:s1<s2);
    }
};
int main()
{
    multiset<string,cmp>s;
    string a;
    while(cin>>a)
    {
        s.insert(a);
    }
    for(multiset<string,cmp>::iterator it=s.begin();it!=s.end();it++)
        cout<<*it<<endl;
    return 0;
}