Submission #1168351

---

Source Code Expand

#include <algorithm>
#include <chrono>
#include <iostream>
#include <vector>

using namespace std;
using namespace std::chrono;

int main() {
  auto start = high_resolution_clock::now();

  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);

  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (int i = 0; i < n; ++i)
    cin >> a[i];
  sort(a.begin(), a.end());

  int ans = 0;
  while (a.size() > 0 && a.back() >= k)
    a.pop_back();
  n = a.size();

  vector<bool> used(k, false);
  for (int i = 0; i < n; ++i) {
    used.assign(k, false);
    used[0] = true;
    for (int j = 0; j < n; ++j) {
      if (i == j)
        continue;
      for (int pos = k - 1; pos >= 0; --pos)
        if (used[pos] && pos + a[j] < k)
          used[pos + a[j]] = true;
    }
    bool exist = false;
    for (int pos = 0; pos < k; ++pos) {
      if (used[pos] && pos + a[i] >= k) {
        exist = true;
        break;
      }
    }
    ans += !exist;
  }

  cout << ans << endl;

  cerr << "Total execution time : " << duration_cast<milliseconds>(high_resolution_clock::now() - start).count() << " ms" << endl;

  return 0;
}

Submission Info

Judge Result