#include<bits/stdc++.h>
#define LL long long
#define mk make_pair
#define pii pair<int,int>
#define fi first
#define se second
using namespace std;
const int N  = 2E5 + 3;
int n,k;
struct node{
	int ai;
	int bi;
}v[N];

vector<int> a[N];

void insert(int x) {
//	cout << x << endl;
	for (int i = 0;; i++) {
		auto it = lower_bound(a[i].begin(), a[i].end(), x);
		if (it == a[i].end()) {
			a[i].push_back(x);
		//	cout << i << " " << a[i].size() << endl;
			return;
		}
	//	printf("%d\n",*it);
		swap(x, *it);
	}
}

inline int read(){
	int v = 0,c = 1;char ch = getchar();
	while(!isdigit(ch)){
		if(ch == '-') c = -1;
		ch = getchar();
	}
	while(isdigit(ch)){
		v = v * 10 + ch - 48;
		ch = getchar();
	}
	return v * c;
}
inline bool cmp(node x,node y){
	return x.ai < y.ai;	
}
int main(){
	n = read(),k = read();
	for(int i = 1;i <= n;++i){
		v[i].ai = read();
		v[i].bi = read();	
	}
	sort(v + 1,v + n + 1,cmp);
	
	for(int i = 1;i <= n;++i) insert(v[i].bi);
	int ans = 0;
	for(int i = 0;i < k;++i) ans += a[i].size();
	cout << ans << endl;
    return 0;
}