Submission #1442322


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)

int main () {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  ll sum = 0;
  rep(i,n) {
    cin >> a[i];
    sum += a[i];
  }
  sort(a.begin(), a.end());

  if(sum < k) {
    cout << n << endl;
    return 0;
  }

  vector<int> can(k,0);
  can[0] = 1;

  for(int i = n - 2; i >= 0; i--) {
    for(int l = k - 1; l >= 0; l--) {
      if(can[l] && l + a[i+1] < k) can[l+a[i+1]] = 1;
    }

    if((i != 0 && a[i] == a[i-1]) || k - a[i] <= 0) continue;
    bool nec = false;
    for(int j = k - a[i]; j < k; j++) {
      if(can[j]) nec = true;
    }
    if(!nec) {
      cout << i + 1 << endl;
      return 0;
    }
  }
  cout << 0 << endl;

  return 0;
}

Submission Info

Submission Time
Task D - No Need
User en30
Language C++14 (GCC 5.4.1)
Score 0
Code Size 817 Byte
Status WA
Exec Time 28 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 0 / 300 0 / 300
Status
AC × 3
AC × 20
WA × 6
AC × 34
WA × 17
Set Name Test Cases
Sample 0_000.txt, 0_001.txt, 0_002.txt
Subtask 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt
All 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 2_026.txt, 2_027.txt, 2_028.txt, 2_029.txt, 2_030.txt, 2_031.txt, 2_032.txt, 2_033.txt, 2_034.txt, 2_035.txt, 2_036.txt, 2_037.txt, 2_038.txt, 2_039.txt, 2_040.txt, 2_041.txt, 2_042.txt, 2_043.txt, 2_044.txt, 2_045.txt, 2_046.txt, 2_047.txt, 2_048.txt, 2_049.txt, 2_050.txt
Case Name Status Exec Time Memory
0_000.txt AC 1 ms 256 KB
0_001.txt AC 1 ms 256 KB
0_002.txt AC 1 ms 256 KB
1_003.txt AC 1 ms 256 KB
1_004.txt AC 1 ms 256 KB
1_005.txt AC 1 ms 256 KB
1_006.txt AC 1 ms 256 KB
1_007.txt WA 1 ms 256 KB
1_008.txt AC 1 ms 256 KB
1_009.txt AC 1 ms 256 KB
1_010.txt AC 1 ms 256 KB
1_011.txt AC 1 ms 256 KB
1_012.txt AC 1 ms 256 KB
1_013.txt AC 1 ms 256 KB
1_014.txt AC 1 ms 256 KB
1_015.txt WA 1 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt WA 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 1 ms 256 KB
1_020.txt AC 1 ms 256 KB
1_021.txt AC 1 ms 256 KB
1_022.txt WA 1 ms 256 KB
1_023.txt AC 1 ms 256 KB
1_024.txt WA 1 ms 256 KB
1_025.txt WA 1 ms 256 KB
2_026.txt AC 1 ms 256 KB
2_027.txt WA 1 ms 256 KB
2_028.txt WA 1 ms 256 KB
2_029.txt AC 22 ms 256 KB
2_030.txt AC 2 ms 256 KB
2_031.txt AC 20 ms 256 KB
2_032.txt AC 3 ms 256 KB
2_033.txt AC 19 ms 256 KB
2_034.txt AC 2 ms 256 KB
2_035.txt AC 3 ms 256 KB
2_036.txt WA 3 ms 256 KB
2_037.txt AC 1 ms 256 KB
2_038.txt WA 1 ms 256 KB
2_039.txt AC 1 ms 256 KB
2_040.txt AC 16 ms 256 KB
2_041.txt AC 18 ms 256 KB
2_042.txt AC 28 ms 256 KB
2_043.txt WA 5 ms 256 KB
2_044.txt AC 16 ms 256 KB
2_045.txt WA 4 ms 256 KB
2_046.txt WA 12 ms 256 KB
2_047.txt WA 12 ms 256 KB
2_048.txt WA 13 ms 256 KB
2_049.txt WA 14 ms 256 KB
2_050.txt WA 14 ms 256 KB