1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cmath>
#include <algorithm>
#include <sstream>
#include <stack>
#include <cstring>
#include <iomanip>
#include <ctime>
using namespace std;
#define pb push_back
#define INF 1001001001
#define FOR(i,n) for(int (i)=0;(i)<(n);++(i))
#define FORI(i,n) for(int (i)=1;(i)<=(n);++(i))
#define mp make_pair
#define pii pair<int,int>
#define ll long long
#define vi vector<int>
#define SZ(x) ((int)((x).size()))
#define fi first
#define se second
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));
#define wez3(n,m,k) int (n),(m),(k); scanf("%d %d %d",&(n),&(m),&(k));
inline void pisz(int n) { printf("%d\n",n); }
template<typename T,typename TT> ostream& operator<<(ostream &s,pair<T,TT> t) {return s<<"("<<t.first<<","<<t.second<<")";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t){FOR(i,SZ(t))s<<t[i]<<" ";return s; }
#define DBG(vari) cerr<<#vari<<" = "<<(vari)<<endl;
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (__typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define TESTS wez(testow)while(testow--)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define IOS ios_base::sync_with_stdio(0);

int a[33], c[33];
pii dp[1<<24]; // 128 MB
// min (k tze mask miesci sie w 0,...,k oraz wypelnienie k)
// jak sie nie da, to (INF,INF)

inline void go (const vi &v, int mask) {
   for (vi::const_iterator it = v.begin(); it != v.end(); ++it) {
      const int i = *it;
      const int newmask = mask ^ (1<<i);
      const int k = dp[newmask].fi;
      if (k != INF) {
         if (c[k] - dp[newmask].se >= a[i]) {
            REMIN(dp[mask], mp(k, dp[newmask].se + a[i]));
         } else if (c[k+1] >= a[i]) {
            REMIN(dp[mask], mp(k+1, a[i]));
         } else {
            // nie wcisniemy
         }
      }
   }
}

vi bity[2][1<<12];

int main () {
   wez2(n,m)
   FOR(i,n) scanf("%d", a+i);
   srand(3500); random_shuffle(a,a+n);

   const int A = n / 2, B = n - A;
   FOR(mask,1<<A) {
      FOR(i,A) if ((1<<i) & mask) bity[0][mask].pb(i);
   }
   FOR(mask,1<<B) {
      FOR(i,B) if ((1<<i) & mask) bity[1][mask].pb(A + i);
   }
   const int AND = (1<<A) - 1;

   vi sorter;
   FOR(j,m) {
      wez(cj)
      sorter.pb(cj);
   }
   sort(sorter.rbegin(), sorter.rend());
   m = min(m, n);
   FOR(j,m) c[j] = sorter[j]; // bins are 0-based!
   c[m] = 0;

   dp[0] = mp(0,0);
   for (int mask = 1; mask < (1<<n); ++mask) {
      // wyliczymy dp[mask]
      dp[mask] = mp(INF,INF);

      go(bity[0][mask & AND], mask);
      go(bity[1][mask >> A], mask);
   }
   if (dp[(1<<n) - 1].fi != INF) {
      pisz(dp[(1<<n) - 1].fi + 1);
   } else {
      printf("NIE");
   }
}