Submission #1358434

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  long n, k;
  cin >> n >> k;

  vector<int> cs(n);

  for (int& i : cs) {
    cin >> i;
  }

  int maxv = cs[0];
  long sum = 0;
  for (int i : cs) {
    maxv = max(maxv, i);
    sum += i;
  }

  long count = 0;
  for (int i : cs) {
    if (sum - i >= k && sum - maxv - i < k) { count += 1; }
  }

  if (sum < k) {
    count = n;
  }

  cout << count << endl;
  return 0;
}

Submission Info

Judge Result