#include <bits/stdc++.h>

using namespace std;
using ll=long long;
//using int=long long;
int const MAXN=2e5+10;
int const INF=2e9+10;
int n,k,ans;

void open(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
//    freopen(TASK".INP","r",stdin);
//    freopen(TASK".OUT","w",stdout);
}
pair<int,int> A[MAXN];

bool compareValue(pair<int,int> a,pair<int,int> b){
    return a.second<b.second;
}

int main() {
    open();
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        A[i].first=a;A[i].second=b;
    }
    sort(A+1,A+n+1,compareValue);
    multiset<int> time;
    for(int i=0;i<k;i++){
        time.insert(-1);
    }

    for(int i=1;i<=n;i++){
        auto it=time.lower_bound(A[i].first);
        if(it==time.begin()) continue;
        it--; ans++;
        time.erase(it);time.insert(A[i].second);

    }
    cout<<ans;

    return 0;
}