C. Songs Compression（简单贪心）

水题

#include<iostream>
#include<algorithm>
using namespace std;
#define LL long long
const int maxn=1e5+;
struct node{int x, y;}a[maxn];
bool cmp(node a, node b){
    return a.x-a.y>b.x-b.y;
}
LL n, m, len, ans, ans1;

int main(){
    cin>>n>>m;
    for(int i=;i<n;++i){
        cin>>a[i].x>>a[i].y;
        ans+=a[i].x;        ans1+=a[i].y;
    }
    if(ans<=m){cout<<<<endl; return ;}
    if(ans1>m){cout<<-<<endl;  return ;}
    else if(ans1==m){cout<<n<<endl; return ;}
    sort(a, a+n, cmp);
    for(int i=;i<n;++i){
        ans=ans-a[i].x+a[i].y;     ++len;
        if(ans<=m)break;
    }
    cout<<len<<endl;
    return ;
}