#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define ull unsigned long long
#define pll pair<ll, ll>
#define mp make_pair
#define ll long long
#define pb push_back
#define deb(x) cout << #x << " = " << x << endl
#define all(x) x.begin(), x.end()
#define ld long double
const ll mod1 = (ll)1e9 + 7;
const ll mod2 = (ll)1e9 + 9;
const ll BASE = 47;
const ll inf = (ll)1e18;
const long double e = 2.718281828459;
const long double pi = 3.141592653;
const ld EPS = 1e-9;
using namespace std;
template <class T>
istream& operator>>(istream &in, vector<T> &arr) {
for (T &cnt : arr) {
in >> cnt;
}
return in;
};
void solve() {
ll n, m, s;
cin >> n >> m >> s;
vector<ll> a(n), b(n);
vector<pair<ll, ll>> d(n);
for (int i = 0; i < n; i++) {
cin >> a[i] >> b[i];
d[i] = {b[i] - a[i], i};
}
vector<bool> put_b(n);
sort(all(d));
ll answer = 0;
for (int i = 0; i < s; i++) {
put_b[d[n - i - 1].second] = true;
answer += b[d[n - i - 1].second];
}
vector<ll> put_a;
for (int i = 0; i < n; i++) {
if (!put_b[i]) {
put_a.pb(a[i]);
}
}
sort(all(put_a));
for (int i = 0; i < m; i++) {
answer += put_a.back();
put_a.pop_back();
}
cout << answer;
}
int main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#else
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
cout.precision(30);
ll seed = time(0);
//cerr << "Seed: " << seed << "\n";
srand(seed);
solve();
return 0;
}
