C :

#include<stdio.h>
int n,x,a[110];
int main()
{
	scanf("%d %d",&n,&x);
	for(int i=1;i<=n;i++)
	scanf("%d",&a[i]);
	for(int i=1;i<n;i++)
	for(int j=i+1;j<=n;j++)
	if(a[i]>a[j])
	{
		int t=a[i];
		a[i]=a[j];
		a[j]=t;
	}
	int s=0;
	for(int i=1;i<=n;i++)
	{
		if(s+a[i]>x)	
		{
		printf("%d",i-1);
		break;
		}
		s+=a[i];
		if(i==n&&s<=x)
		printf("%d",i);
		else
		if(i==n)
		printf("%d",i-1);
	}
	return 0;
}

C++ :

#include <bits/stdc++.h>
using namespace std;

int main(){
	int n,x,a[100],i,r = 0;
	cin>>n>>x;
	for(i = 0;i < n;i++){
		cin>>a[i];
	}
	sort(a,a+n);
	for(i = 0;i < n;i++){
		if(r + a[i] > x){
			r = r + a[i];
			cout<<i<<endl;
			break;
		}else{
			r = r + a[i];
		}
	}
	
	if(r < x){
		cout<<n<<endl;
	}
}

Python :

s = input().split()
a = input().split()
n = int(s[0])
x = int(s[1])
su = 0
l = []
for i in range(0, n):
    a[i] = int(a[i])
a.sort()
for i in range(0, n):
    su += a[i]
    if su <= x:
        l.append(i)
print(len(l))