简单代码一定对！！！

#include<bits/stdc++.h>
using namespace std;
struct s{
    int m;
    int id;
} b[10000];
bool cmp (s l,s r){
    if(l.m!=r.m){return l.m<r.m;}
    else{return l.id<r.id;}
}
int main(){
int a,c;
    
    cin>>c>>a;
    for(int i=0;i<a;i++){
        cin>>b[i].m;b[i].id=i+1;
        
    }
    sort(b+0,b+a,cmp);
    int sum=0;int akm=sum;
    for(int i=0;i<a;i++){
        if(sum+b[i].m<=c){sum+=b[i].m;akm++;}
        }
    
 printf("%d",akm);
}