为什么不加sort就会80pts

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+100;
bool dp[N];
bool vis[N];
int read(){
	int ans=0,f=1;
	char op=getchar();
	while(op<'0'||op>'9'){
		if(op=='-')f=-1;
		op=getchar();
	}
	while(op>='0'&&op<='9'){
		ans=(ans<<3)+(ans<<1)+op-'0';
		op=getchar();
	}
	return ans*f;
}
int n,m;
int tot,maxx,ans;
int number[N];
void make_dp(){
	memset(dp,0,sizeof(dp));maxx=0;
	dp[0]=1;
	for(int i=1;i<=n;i++){
		if(vis[i])continue;
		for(int j=tot;j>=number[i];j--){
			dp[j]=dp[j]|dp[j-number[i]];
		}
	}
	for(int i=1;i<=tot;i++)if(dp[i])maxx++;
	ans=max(ans,maxx);
}
void dfs(int x,int cut){
	if(cut>m)return;
	if(x==n){
//		cout<<"cut:"<<cut<<'\n';
//		for(int i=1;i<=n;i++)cout<<vis[i]<<' ';
//		cout<<'\n';
		if(cut==m){
			make_dp();
		}
		return;
	}
	vis[x]=true;
	dfs(x+1,cut+1);
	vis[x]=false;
	dfs(x+1,cut);
}
int main(){
	n=read(),m=read();
	for(int i=1;i<=n;i++)number[i]=read(),tot+=number[i];
	sort(number+1,number+n+1);
	dfs(1,0);
	printf("%d",ans);
	return 0;
}