2021年天梯赛L2-03

• 题意
  
• 思路
  STL永远的神。。。

#include<bits/stdc++.h>

using namespace std;

const int N=1e3+10;
char liu[N][N];
int cnt[N];
#define PII pair<vector<int>,int> 
#define x first
#define y second
vector<PII> vec;
bool cmp(PII a,PII b)
{
    if(a.y!=b.y){
        return a.y>b.y;
    }
    else{
        return a.x<b.x;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m;
    cin>>n>>m;
    map<vector<int>,int> mp;
    //map<string,vector<int> > cnt;
    for(int i=1;i<=n;i++){
        vector<int> temp;
        for(int j=1;j<=m;j++){
            int x;
            cin>>x;
            temp.push_back(x);
        }
        //cnt[s].pop_back();
        mp[temp]++;
    }
    for(auto &item:mp){
        vec.push_back({item.first,item.second});
    }
    sort(vec.begin(),vec.end(),cmp);
    cout<<vec.size()<<endl;
    for(auto &item:vec){
        cout<<item.second<<" ";
        int len=item.first.size();
        for(int i=0;i<item.first.size()-1;i++){
            cout<<item.first[i]<<" ";
        }
        cout<<item.first[len-1]<<endl;
    }
    return 0;
}