ARC070D No Need

原题链接：https://beta.atcoder.jp/contests/arc070/tasks/arc070_b

No Need

Problem Statement

AtCoDeer the deer has $N$ cards with positive integers written on them. The number on the $i$-th card $(1≤i≤N)$ is $a_i$. Because he loves big numbers, he calls a subset of the cards good when the sum of the numbers written on the cards in the subset, is $K$ or greater.

Then, for each card $i$, he judges whether it is unnecessary or not, as follows:

If, for any good subset of the cards containing card $i$, the set that can be obtained by eliminating card $i$ from the subset is also good, card $i$ is unnecessary.

Otherwise, card $i$ is NOT unnecessary.

Find the number of the unnecessary cards. Here, he judges each card independently, and he does not throw away cards that turn out to be unnecessary.

Constraints

All input values are integers.
$1≤N≤5000$
$1≤K≤5000$
$1≤a_i≤10^9(1≤i≤N)$

Partial Score

$300$ points will be awarded for passing the test set satisfying $N,K≤400$
.

Input

The input is given from Standard Input in the following format:

$N\ K$

$a_1\ a_2\ \cdots\ a_N$

Output

Print the number of the unnecessary cards.

Sample Input 1

3 6
1 4 3

Sample Output 1

1

There are two good sets: $\{2,3\}$and $\{1,2,3\}$.

Card $1$ is only contained in $\{1,2,3\}$, and this set without card $1$, $\{2,3\}$, is also good. Thus, card $1$ is unnecessary.

For card $2$, a good set $\{2,3\}$ without card $2$, $\{3\}$, is not good. Thus, card $2$ is NOT unnecessary.

Neither is card $3$ for a similar reason, hence the answer is $1$
.

Sample Input 2

5 400
3 1 4 1 5

Sample Output 2

5

In this case, there is no good set. Therefore, all the cards are unnecessary.

Sample Input 3

6 20
10 4 3 10 25 2

Sample Output 3

3

题目大意

输入$N$ 个数字 $A_1, A_2,\cdots , A_N$，输入$K$。

如果对于所有包含 $A_i$，且和大于 $K$ 的集合，去掉$A_i$ 后和还大于 $K$，那么 $A_i$ 就是可有可无的。

问有多少个元素是可有可无的。

题解

将所有数从小到大排序，可有可无的数一定是一段前缀。

设$A_1+ A_2+\cdots + A_i=sum$，如果$A_{i+1},+A_{i+2}+\cdots + A_N$无法凑出$K-sum\sim K-1$中的任意一个数，那么$A_1\sim A_i$就全是可有可无的。

因为我们要凑的只是$[0,K]$范围内的数，所以$A_i=min(A_i,K)$，最后背包的容量只有$K$，复杂度为$O(NK)$。

代码

#include<bits/stdc++.h>
using namespace std;
const int M=5005;
int n,k,sum,a[M],dp[M];
void in()
{
    scanf("%d%d",&n,&k);
    for(int i=1;i<=n;++i)scanf("%d",&a[i]),a[i]=min(a[i],k),sum+=a[i];
}
void ac()
{
    sort(a,a+n+1);dp[0]=1;
    for(int i=n,flag=1;i>=0;flag=1,sum-=a[i--])
    {
        for(int j=k-1;j>=k-sum&&j>=0;--j)if(dp[j])flag=0;
        if(flag)printf("%d",i),exit(0);
        for(int j=k;j>=a[i];--j)dp[j]|=dp[j-a[i]];
    }
}
int main(){in();ac();}