#include using namespace std; #define rep(i,n) for(int i=0;i> L >> N; vector W(N); rep(i, N) cin >> W[i]; sort(begin(W), end(W)); int count = 0; while(L - W[count] >= 0 && count < N){ L -= W[count++]; } cout << count << endl; return 0; }