//================================= // Created on: 2018/09/07 21:49:21 //================================= #include #define show(x) std::cerr << #x << " = " << x << std::endl using ll = long long; int main() { int T, N; std::cin >> T >> N; std::vector t(N); for (int i = 0; i < N; i++) { std::cin >> t[i]; } const int mask = 1 << N; std::vector sum(mask, 0); for (int i = 0; i < mask; i++) { for (int j = 0; j < N; j++) { if (i & (1 << j)) { sum[i] = sum[i - (1 << j)] + t[j]; break; } } } std::vector dp(mask, T + 1); dp[0] = 0; for (int j = 1; j <= N; j++) { for (int i = mask - 1; i >= 0; i--) { for (int j = i; j > 0; j = (j - 1) & i) { if (dp[i - j] > T or sum[j] > T) { continue; } dp[i] = std::min(dp[i], std::max(dp[i - j], sum[j])); } } if (dp[mask - 1] <= T) { return std::cout << j << std::endl, 0; } } return 0; }