D2. Too Many Segments (hard version)

http://codeforces.com/contest/1249/problem/D2

#include <bits/stdc++.h>
#include <queue>
//#include <cmath>
//#include <iostream>
//#include <unordered_map>

#define lson rt<<1
#define rson rt<<1|1
#define lowbit(x) ((x)&(-x))
#define mem(x,y) memset(x,y,sizeof(x))
#define pb push_back
#define INF 0x3f3f3f3f
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int mod=1e9+7;
const int N=2e5+9;


vector<pair<int,int> > a[N];
set<pair<int,int> >s;
vector<int>ans;
int main()
{
    FAST_IO;

    int n,k;
    cin>>n>>k;
    int maxx=0;
    for(int i=1;i<=n;i++)
    {
        int l,r;
        cin>>l>>r;
        a[l].pb({r,i});
        maxx=max(maxx,r);
    }

    for(int i=1;i<=maxx;i++)
    {
        for(int j=0;j<a[i].size();j++) s.insert(a[i][j]);
        while(!s.empty()&&s.size()>k)
        {
            ans.pb(s.rbegin()->second);
            s.erase(*s.rbegin());
        }
        while(!s.empty()&&s.begin()->first==i) s.erase(*s.begin());
    }

    cout<<ans.size()<<endl;
    for(int i=0;i<ans.size();i++) cout<<ans[i]<<" ";
    cout<<endl;


    return 0;
}