#include <bits/stdc++.h>
using namespace std;
#define overload2(a, b, c, ...) c
#define overload3(a, b, c, d, ...) d
#define overload4(a, b, c, d, e ...) e
#define overload5(a, b, c, d, e, f ...) f
#define overload6(a, b, c, d, e, f, g ...) g
#define fast_io ios::sync_with_stdio(false); cin.tie(nullptr);
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
typedef long long ll;
typedef long double ld;
#define chmin(a,b) a = min(a,b);
#define chmax(a,b) a = max(a,b);
#define bit_count(x) __builtin_popcountll(x)
#define leading_zero_count(x) __builtin_clz(x)
#define trailing_zero_count(x) __builtin_ctz(x)
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) a / gcd(a,b) * b
#define rep(...) overload3(__VA_ARGS__, rrep, rep1)(__VA_ARGS__)
#define rep1(i,n) for(int i = 0 ; i < n ; i++)
#define rrep(i,a,b) for(int i = a ; i < b ; i++)
#define repi(it,S) for(auto it = S.begin() ; it != S.end() ; it++)
#define pt(a) cout << a << endl;
#define print(...) printall(__VA_ARGS__);
#define debug(a) cout << #a << " " << a << endl;
#define all(a) a.begin(), a.end()
#define endl "\n";
#define v1(T,n,a) vector<T>(n,a)
#define v2(T,n,m,a) vector<vector<T>>(n,v1(T,m,a))
#define v3(T,n,m,k,a) vector<vector<vector<T>>>(n,v2(T,m,k,a))
#define v4(T,n,m,k,l,a) vector<vector<vector<vector<T>>>>(n,v3(T,m,k,l,a))
template<typename T,typename U>istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<typename T,typename U>ostream &operator<<(ostream&os,const pair<T,U>&p){os<<p.first<<" "<<p.second;return os;}
template<typename T>istream &operator>>(istream&is,vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>istream &operator>>(istream&is,vector<vector<T>>&v){for(T &in:v){is>>in;}return is;}
template<typename T>ostream &operator<<(ostream&os,const vector<vector<T>>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?"\n":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const set<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<typename T>ostream &operator<<(ostream&os,const multiset<T>&v){for(auto it=v.begin();it!=v.end();){os<<*it<<((++it)!=v.end()?" ":"");}return os;}
template<class... Args> void printall(Args... args){for(auto i:initializer_list<common_type_t<Args...>>{args...}) cout<<i<<" ";cout<<endl;}

int n, d;
vector<pair<ll,ll>> P;

bool f(ll x){
    vector<pair<ll,ll>> A;
    vector<pair<ll,ll>> Q;
    rep(i,n) {
        auto[a,b] = P[i];
        if(a <= b){
            Q.push_back({a,b});
        }
        else{
            A.push_back({b,a});
        }
    }
    ll val = 0;
    ll cnt = 0;
    sort(all(Q));
    sort(all(A),greater<pair<ll,ll>>());
    rep(i,n){
        auto[a,b] = Q[i];
        if(val - a >= x) {
            val += b - a;
            cnt++;
        }
    }
    if(cnt >= d) return true;
    int m = A.size();
    int c = d - cnt;
    vector<vector<ll>> dp(m+1,vector<ll>(c+1,-1e9));
    dp[0][0] = val;
    rep(i,m){
        auto[b,a] = A[i];
        rep(j,c+1){
            chmax(dp[i+1][j],dp[i][j]);
            if(j < c && dp[i][j] - a >= x) chmax(dp[i+1][j+1], dp[i][j] - a + b);
        }
    }
    return dp[m][c] != -1e9;
}

void solve(){
    cin >> n >> d;
    P = vector<pair<ll,ll>>(n);
    cin >> P;
    ll lef = 0, rig = 1e9;
    while(rig - lef > 1){
        ll mid = (lef + rig) / 2;
        if(f(-mid)) rig = mid;
        else lef = mid;
    }
    pt(-rig);
}

int main(){
    fast_io
    int t = 1;
    // cin >> t;
    rep(i,t) solve();
}