Submission #1338912

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18;
const double PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

void solve(){
	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());
	const int index = lower_bound(A.begin(),A.end(),K) -A.begin();
	vector< vector<bool> > Left(N+1,vector<bool>(K+1,false));
	vector< vector<bool> > Right(N+1,vector<bool>(K+1,false));
	Left[0][0] = true;
	for(int i=0;i<index;++i){
		Left[i+1] = Left[i];
		for(int v=K;v>=0;--v){
			if( v-A[i] >= 0 ){
				(Left[i+1][v]) = (Left[i+1][v])|(Left[i][v-A[i]]);
			}
		}
	}
	Right[0][0] = true;
	for(int i=0;i<index;++i){
		int Aindex = index-1-i;
		Right[i+1] = Right[i];
		for(int v=K;v>=0;--v){
			if( v-A[Aindex] >= 0 ){
				(Right[i+1][v]) = (Right[i+1][v])|(Right[i][v-A[Aindex]]);
			}
		}
	}
	/*
	index個の数列
	Ai(0index)を使わない場合i[0,index)
	Left[i][*]+Right[index-1-i][*]
	*/
	int L,R,mid;
	LL sum = 0;
	for(int i=0;i<index;++i){
		sum += A[i];
	}
	if( sum < K ){
		cout << index << endl;
		return;
	}else{
		R = index;
	}
	L = -1;
	while(R-L>1){//二分探索
		mid = (L+R)/2;//A[mid]を使わない
		bool flag = false;
		for(int ter=K-A[mid];ter<K;++ter){//作る数
			for(int v=0;v<=ter;++v){//v:左で作る,ter-v:右で作る
				if( Left[mid][v] && Right[index-1-mid][ter-v]){
					flag = true;
					break;
				}
			}
			if( flag ) break;
		}
		if( flag ){
			R = mid;
		}else{
			L = mid;
		}
	}
	cout << R << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	
	
	solve();
}
#pragma endregion //main()

Submission Info

Judge Result