题目:
题意:
给出每个飞机的信息,求最少用多少飞机能把所有人安全运输
分析:
纯贪心,不解释
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<map>
#include<list>
#include<ctime>
#include<iomanip>
#include<string>
#include<bitset>
#include<deque>
#include<set>
#define LL long long
using namespace std;
inline LL read(){
LL d=0,f=1;char s=getchar();
while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}
while(s>='0'&&s<='9'){d=d*10+s-'0';s=getchar();}
return d*f;
}
struct node{
int l,f;
}e[100005];
bool cmp(node x,node y)
{
return x.l>y.l;
}
int main()
{
int n=read(),m=read(),k=read()*2;
for(int i=1;i<=n;i++) e[i].l=read(),e[i].f=read();
sort(e+1,e+1+n,cmp);
int ans=0;
for(int i=1;i<=n&&m>0;i++)
if(e[i].f>=k) ans++,m-=e[i].l;
if(m>0) printf("-1");
else cout<<ans;
return 0;
}