#include <bits/stdc++.h>

using namespace std;

#define forn(i, k, e) for (int i = k; i < e; i++)
typedef pair<int, int> pii;

int32_t main() {
    int n, k;
    cin >> n >> k;
    vector<pair<int, int>> movies;
    forn(i, 0, n) {
        int a, b;
        cin >> a >> b;
        movies.push_back({b, a}); // insert end time, start time
    }
    sort(movies.begin(), movies.end()); // sort based on end time
    int count = 0;
    priority_queue<int, vector<int>, greater<int>> end; // min heap to store min end times on top
    forn(i, 0, k) end.push(0);
    forn(i, 0, n) {
        pii cur = movies[i];
        if(end.top() > cur.second) continue; // movie ends after cur movie starts
        end.pop();
        end.push(cur.first); // store end time of cur movie;
        ++count;
    }
    cout << count;
    return 0;
}

#include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;

int main() {
	int n, k;
	cin >> n >> k;
	vector<pair<int, int>> v(n);
	for (int i = 0; i < n; i++)  // read start time, end time
		cin >> v[i].second >> v[i].first;
	sort(begin(v), end(v));  // sort by end time

	int maxMovies = 0;
	multiset<int> end_times;  // times when members will finish watching movies
	for (int i = 0; i < k; ++i) end_times.insert(0);

	for (int i = 0; i < n; i++) {
		auto it = end_times.upper_bound(v[i].second);
		if (it == begin(end_times)) continue;
		// assign movie to be watched by member in multiset who finishes at time
		// *prev(it)
		end_times.erase(--it);
		// member now finishes watching at time v[i].first
		end_times.insert(v[i].first);
		++maxMovies;
	}

	cout << maxMovies;
}