95pts WA on #13求条

#include <bits/stdc++.h>
using namespace std;
long long n,m;
long long v[400005],w[400005];
bool vis[400005];
long long cst=0; 
long long o,x,y;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>v[i]>>w[i];
    multiset <long long> s;
    priority_queue<pair<long long,long long>> pq;
    for(int i=1;i<=n;i++) pq.push(make_pair(w[i],i));
    s.insert(pq.top().first);
    cst+=v[pq.top().second];
    vis[pq.top().second]=1;
    pq.pop();
    long long minn=s.empty()?LONG_LONG_MAX:*s.begin();
    while(!pq.empty())
    {
        if(pq.top().first<minn) break;
        cst+=v[pq.top().second];
        s.insert(pq.top().first);
        vis[pq.top().second]=1;
        pq.pop();
    }
    for(int i=1;i<=m;i++)
    {
        cin>>o>>x>>y;
        if(o==1)
        {
            v[n+i]=x;
            w[n+i]=y;
            pq.push(make_pair(y,n+i));
        }
        else
        {
            if(vis[x]==1)
            {
                s.erase(s.find(w[x]));
                w[x]=y;
                s.insert(y);
            }
            else
            {
                w[x]=y;
                pq.push(make_pair(y,x));
            }
        }
        minn=s.empty()?LONG_LONG_MAX:*s.begin();
        while(!pq.empty())
        {
            if(pq.top().first<minn) break;
            if(w[pq.top().second]!=pq.top().first) pq.pop();
            else
            {
                cst+=v[pq.top().second];
                s.insert(pq.top().first);
                vis[pq.top().second]=1;
                pq.pop();
            }
        }
        cout<<cst<<"\n";
    }
    return 0;
}