WA+AC求条

#include<bits/stdc++.h>
#define int long long
using namespace std;
struct node
{
    int p,c;
}a[2001];
bool cmp(node x,node y)
{
    return x.c<y.c;
}
priority_queue<int,vector<int>,less<int> >tot2;
int tong[2001];
signed main()
{
    int n,m,tot1=0,ans=0;
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        cin>>a[i].p>>a[i].c;
        if(a[i].p==1)tot1++;
        else tong[a[i].p]++;
    }
    for(int i=2;i<=n;i++){tot2.push(tong[i]);}
    for(int i=1;i<=m;i++)
    {
        if(a[i].p!=1)
        {
            //cout<<tot2.top();
            if(tot1<=tot2.top())
            {
                tot1++;
                tot2.pop();
                a[i].p=1;
                ans+=a[i].c;
            }
        }
    }
    cout<<ans;
}