Submission #1793965


Source Code Expand

#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
using namespace std;
int main(void) {
  int n, k;
  cin >> n >> k;
  vector<int> a;
  int need = 0;
  for (int i = 0; i < n; i++) {
    int b;
    cin >> b;
    if (b < k) {
      a.push_back(b);
    }
  }
  bitset<5000> bs;
  sort(a.begin(), a.end());
  int lhs = 0, rhs = a.size();
  while(rhs != lhs) {
    bs.reset();
    bs[0] = 1;
    int i = (lhs + rhs) / 2;
    for (int j = 0; j < a.size(); j++) {
      if (j != i) {
        bs = bs | bs << a[j];
      }
    }
    bool isneed = 0;
    for (int j = k - a[i]; j < k; j++) {
      isneed |= bs[j];
    }
    if (isneed) {
      rhs = i;
    } else {
      lhs = i + 1;
    }
  }
  cout << rhs << endl;
  return 0;
}

Submission Info

Submission Time
Task D - No Need
User comethelp
Language C++14 (GCC 5.4.1)
Score 600
Code Size 791 Byte
Status AC
Exec Time 21 ms
Memory 256 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 300 / 300
Status
AC × 3
AC × 26
AC × 51
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 AC 1 ms 256 KB
1_008.txt AC 2 ms 256 KB
1_009.txt AC 2 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 AC 2 ms 256 KB
1_016.txt AC 1 ms 256 KB
1_017.txt AC 1 ms 256 KB
1_018.txt AC 1 ms 256 KB
1_019.txt AC 1 ms 256 KB
1_020.txt AC 2 ms 256 KB
1_021.txt AC 2 ms 256 KB
1_022.txt AC 1 ms 256 KB
1_023.txt AC 1 ms 256 KB
1_024.txt AC 2 ms 256 KB
1_025.txt AC 2 ms 256 KB
2_026.txt AC 1 ms 256 KB
2_027.txt AC 1 ms 256 KB
2_028.txt AC 1 ms 256 KB
2_029.txt AC 21 ms 256 KB
2_030.txt AC 19 ms 256 KB
2_031.txt AC 3 ms 256 KB
2_032.txt AC 3 ms 256 KB
2_033.txt AC 2 ms 256 KB
2_034.txt AC 2 ms 256 KB
2_035.txt AC 2 ms 256 KB
2_036.txt AC 19 ms 256 KB
2_037.txt AC 1 ms 256 KB
2_038.txt AC 1 ms 256 KB
2_039.txt AC 1 ms 256 KB
2_040.txt AC 2 ms 256 KB
2_041.txt AC 20 ms 256 KB
2_042.txt AC 20 ms 256 KB
2_043.txt AC 8 ms 256 KB
2_044.txt AC 12 ms 256 KB
2_045.txt AC 12 ms 256 KB
2_046.txt AC 10 ms 256 KB
2_047.txt AC 10 ms 256 KB
2_048.txt AC 10 ms 256 KB
2_049.txt AC 8 ms 256 KB
2_050.txt AC 7 ms 256 KB