Submission #1336474

---

Source Code Expand

// Copyright 2017 wu_qing
#include <cstdio>
#include <bitset>
#include <algorithm>
const int N = 5e3 + 10, M = N * N;
std::bitset<M> b;
int n, k, t, l, r, cnt, a[N];
inline bool check(int x) {
    b.reset();
    b[0] = 1;
    for (int i = 1; i <= cnt; i++) {
        if (i == x) continue;
        b |= b << a[i];
    }
    for (int i = k - a[x]; i < k; i++)
        if (b[i])
            return true;
    return false;
}
int main() {
    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &t);
        if (t <= k)
            a[++cnt] = t;
    }
    std::sort(a + 1, a + cnt + 1);
    l = 0;
    r = cnt;
    while (l < r) {
        int m = (l + r) / 2;
        if (check(m + 1))
            r = m;
        else
            l = m + 1;
    }
    printf("%d\n", r);
    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
                          ^
./Main.cpp:23:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &t);
                        ^

Judge Result