Submission #1167871

---

Source Code Expand

#include <bits/stdc++.h>

#define INF (1e9)
#define INF_LL (1e17)

using LL = long long;
using ULL = unsigned long long;

using namespace std;

#define MAX_N 5005
#define MAX_K 5005

int N, K;
LL A[MAX_N];
bool used[MAX_N];

int main()
{
  cin >> N >> K;
  LL checkSum = 0;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    checkSum += A[i];
  }

  if(checkSum < K){
    cout << N << endl;
    return 0;
  }

  sort(A, A+N);

  reverse(A, A+N);

  int ans = 0;
  for (int i = 0; i < N; i++) {
    memset(used, 0, sizeof(used));
    LL tmpAns = 0;
    for (int j = 0; j < N; j++) {
      if(i == j){
        continue;
      }
      if(tmpAns + A[j] < K){
        tmpAns += A[j];
      }
    }
    if(tmpAns >= K-A[i]){
      ans++; //cerr << i << endl;
    }
  }

  cout << N - ans << endl;

  return 0;
}

Submission Info

Judge Result