60分，不知道怎么优化

#include <bits/stdc++.h>
using namespace std;
int n,m,t;
int price[105];
int tim[105];
int maxn=INT_MIN;
void dfs(int x,int sump,int sumt,int ans)
{
	if(sump>m)return;
	if(sumt>t)return;
	if(x==n+1)
	{
		maxn=max(maxn,ans);
		return;
	}
	dfs(x+1,sump+price[x],sumt+tim[x],ans+1);
	dfs(x+1,sump,sumt,ans);
}
int main()
{
	cin>>n>>m>>t;
	for(int i=1;i<=n;i++)cin>>price[i]>>tim[i];
	dfs(1,0,0,0);
	cout<<maxn;
	return 0;
}