求助

#include<bits/stdc++.h>
using namespace std;
int n,t,P,q,p[105],c[105],ans1,ans2,ans;
bool vis[105];
void dfs(int u){
    if(ans1>=P&&ans2<=q){
        ans=min(ans,ans2);
        return;
    }
    for(int i=u;i<=n;++i){
        ans1+=p[i];
        ans2+=c[i];
        vis[i]=1;
        dfs(u+1);
        ans1-=p[i];
        ans2-=c[i];
        vis[i]=0;
    }
}
int main(){
    cin>>t;
    while(t--){
    	ans=INT_MAX;
        cin>>n>>P>>q;
        for(int i=1;i<=n;++i) cin>>p[i]>>c[i];
        dfs(1);
        if(ans!=INT_MAX) cout<<ans;
        else cout<<-1;
        cout<<endl;
    }
    return 0;
}