#include<bits/stdc++.h>
using namespace std;
struct kk{
	int a,b; 
}s[100001];
bool cmp(kk x,kk y)
{
	return x.a-x.b>y.a-y.b;
}
long long n,m,sum,nn,ss;
int main()
{
	cin>>n>>m;
	nn=n;
	for(int i=1;i<=n;i++)
	{
		cin>>s[i].a>>s[i].b;
		if(i==m){
			sum+=s[i].a;
			s[i].a=0;s[i].b=100002;
		}
		if(s[i].a<s[i].b)nn--;
	}
	sort(s+1,s+n+1,cmp);
	for(int i=1;i<=nn;i++)sum+=s[i].a-s[i].b;
	ss=nn;
	cout<<sum<<endl;
	for(int i=nn+1;i<=n;i++)
	{
		if(sum+s[i].a-s[i].b<0)
		{
			cout<<ss<<endl;
			return 0;
		}
		else 
		{
			sum+=s[i].a-s[i].b;
			ss++;
		}
	}
	return 0;
}