#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<algorithm>
using namespace std;
struct SS {
long a; //原大小
long b; //压缩后
} q[100005];
bool cmp(struct SS p1, struct SS p2) {
if (p1.a > p2.a) return true;
if (p1.a == p2.a && p1.b <= p2.b) return true;
return false;
}
int main() {
priority_queue<int> que; //默认为大顶堆
long n, m, sum = 0, cnt = 0;
cin >> n >> m; //歌曲数 硬盘大小
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
sum += x;
que.push(x - y);
q[i].a = x, q[i].b = y;
}
//sort(q,q+n,cmp);
}
