csp数字排序

#include <bits/stdc++.h>
using namespace std;
struct P
{
    int c;int k;
};
struct cmp
{
    bool operator () (const P& p1,const P& p2)
    {
        if(p1.k==p2.k)
            return p1.c<p2.c;
        return p1.k > p2.k;
    }
};
int main()
{
    int n;
    cin>>n;
    vector<int> v;
    set<P,cmp> ms;
    for(int i=0,x;i<n;++i)
    {
        cin>>x;
        v.push_back(x);
    }
    //n = unique(v.begin(),v.end())-v.begin();
    for(int i=0;i<n;++i)
    {
        int x=count(v.begin(),v.end(),v[i]);
        struct P p;
        p.c=v[i];p.k=x;
        ms.insert(p);
    }
    set<P,cmp>::iterator it=ms.begin();
    do
    {
        cout<<(*it).c<<" "<<(*it).k<<endl;
        it++;
    }while(it!=ms.end());
    return 0;
}