Submission #3774538

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main() {
	int N, X;
	cin >> N >> X;
	int a[110];
	int i;
	for(i=0; i<N; ++i) cin >> a[i];
	int c=0;
	sort(a, a + N);
	i=0;
	while(i<N){
	    if(X>=a[i]){
	        X -= a[i];
	        ++c;
	        ++i;
	    }
	    else break;
	}
	cout << c << endl;
	return 0;
}

Submission Info

Judge Result