Submission #3776439

---

Source Code Expand

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

int main() {
  int N, x;
  int a[110];
  cin >> N >> x;
  for(int i=0; i<N; i++) cin>>a[i];

  sort(a, a+N);
  
  int count=0;
  for(int i=0; i<N; i++) {
    if(x<0) break;
    x-=a[i];
    count++;
  }
  if(x!=0) count--;
  cout << count << endl;
}

Submission Info

Judge Result