Candy box
Description :Princess Biving has a lot of candies ,and this day she wants to eat some of them .
Formally speaking ,Biving has N candy boxes ,and the ith box contains Ci candies .she wants to open no more than K of N boxes and the sum of candies of these K boxes is exactly M ,tell Biving whether she can accomplish this idea.
Input specification:
The input contains multiple test cases (<=100).
The first line of each test case contains two integer N,Q(1<=N<=100,1<=Q<=1000)which mean the number of candy boxes and queries Next line contains N integer C!,C2,....,CN(1<=Ci<=100).Then comes Q lines ,each line has two integers Ki and Mi(1<=ki<=N,1<=Mi<10000).
output specification:
For each case ,first output "Case #c:",then for each query output "Yes"in a single line if Biving can accomplish her idea ,otherwise output "No".
Sample input:
4 2
1 2 2 4
1 3
2 3
4 1
1 2 4 8
3 7
Sample output:
Case #1:
No
Yes
Case #2:
Yes
这题怎么做啊？不知道怎么挑几个数相加
