# 这个问题如何使用排列组合的思路去实现？C语言具体的做法是什么的？

Problem Description
There is a mountain near yifenfei’s hometown. On the mountain lived a big monster. As a hero in hometown, yifenfei wants to kill it.
Now we know yifenfei have n spells, and the monster have m HP, when HP <= 0 meaning monster be killed. Yifenfei’s spells have different effect if used in different time. now tell you each spells’s effects , expressed (A ,M). A show the spell can cost A HP to monster in the common time. M show that when the monster’s HP <= M, using this spell can get double effect.

Input
The input contains multiple test cases.
Each test case include, first two integers n, m (2<n<10, 1<m<10^7), express how many spells yifenfei has.
Next n line , each line express one spell. (Ai, Mi).(0<Ai,Mi<=m).

Output
For each test case output one integer that how many spells yifenfei should use at least. If yifenfei can not kill the monster output -1.

Sample Input
3 100
10 20
45 89
5 40

3 100
10 20
45 90
5 40

3 100
10 20
45 84
5 40

Sample Output
3
2
-1

• 写回答

#### 1条回答默认 最新

• threenewbee 2019-08-28 22:31
关注
本回答被题主选为最佳回答 , 对您是否有帮助呢?
评论

#### 悬赏问题

• ¥15 BDSBAS-B1C和B1C信号有什么不同
• ¥15 在半圆平面内随机生成点坐标
• ¥15 系统容量变化的几种多址方式TDMA, CDMA,FDMA,OFDMA 对比，应该给的是一个曲线 图，随着系统容量的增加，几种多址方式性能的对比 图,MATLAB程序仿真折线图
• ¥15 用visual Studio 写c ++只运行上一个旧代码的运行结果是怎么回事
• ¥15 系统容量变化的几种多址方式（TDMA，FDMA，OFDMA，CDMA）对比（相关搜索：曲线图）
• ¥15 worldclim 历史及未来气候数据矫正
• ¥15 ajax服务器不能下载
• ¥15 运用c++和opencv实现二维码的识别和三维坐标的建立