7-12 inventory code base

Have to say , The code of others is really good

c++ Containers set Custom sort _zhusf The blog of -CSDN Blog _c++set Sort

#include <bits/stdc++.h>

using namespace std;

const int N = 1e4+10;
struct cmp// Customize set Sort 
{
    bool operator() (const pair<int,vector<int> >&a, const pair<int,vector<int> >&b) const
    {
        if(a.first!=b.first)
            return a.first>b.first;
        else return a.second<b.second;
    }
};

set<vector<int> > st;// Save module 
map<vector<int>,int> mp;// Number of stored modules 
set<pair<int,vector<int> >,cmp > St;// Sort 

int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0; i<n; i++)
    {
        vector<int> vt;
        for(int j=0; j<m; j++)
        {
            int x;
            cin>>x;
            vt.push_back(x);
        }
        mp[vt]++;
        st.insert(vt);
    }
    cout<<st.size()<<endl;
    set<vector<int> >::iterator it;
    for(it=st.begin(); it!=st.end(); it++)
    {
        St.insert({mp[*it],*it});
    }
    set<pair<int,vector<int> > >::iterator ite;
    for(ite=St.begin(); ite!=St.end(); ite++)
    {
        cout<<(*ite).first;
        for(int i=0; i<(*ite).second.size(); i++)
            cout<<' '<<(*ite).second[i];
        cout<<endl;
    }
    return 0;
}