entertainmentbox.cpp

// Michael Pfeifer
// Version 04, 2018/02/17

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;

const ld  pi   = 4.0*atanl(1.0);
const int iinf = 1e9 + 10;
const ll  inf  = 1e18 + 10;
const int mod  = 1000000007;
const ld  prec = .000001;

#define enld endl
#define endl '\n'
#define pb push_back
#define debug(x) cout<<#x<<" -> "<<x<<'\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define uni(x) (x).erase(unique(all(x)), (x).end())
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (ll)(n); ++i)
#define umap unordered_map
#define uset unordered_set

template<class TIn>
using indexed_set = tree<
        TIn, null_type, less<TIn>,
        rb_tree_tag, tree_order_statistics_node_update>;

void fast() {
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

void file() {
    auto a = freopen("a.in",  "r", stdin);
    auto b = freopen("a.out", "w", stdout);
    if(!a || !b) cout << "uh oh" << endl;
}





struct event {
    int start, end;
};

bool cmp1(event& e1, event& e2) {
    if(e1.end == e2.end) {
        return e1.start > e2.start;
    }
    return e1.end < e2.end;
}

int main() {
    //file();
    //fast();

    int n, m;
    cin >> n >> m;

    vector<event> v(n);
    for(auto& i : v) {
        cin >> i.start >> i.end;
    }

    sort(all(v), cmp1);

    int included = 0;
    multiset<int> endtimes;
    for(auto& i : v) {
        auto it = endtimes.upper_bound(i.start);
        if(it != endtimes.begin()) {
            it--;

            if(*it <= i.start) {
                endtimes.erase(it);
                endtimes.insert(i.end);
                included++;
                continue;
            }
        }

        if(endtimes.size() < m) {
            endtimes.insert(i.end);
            included++;
        }
    }

    cout << included << endl;

    return 0;
}