Subset sum(recursion competitive programming) iam getting wrong answer please help me out

#include
#include
#include
#include
#include
using namespace std;
#define ll long long int
#define mod 1000000007
#define pi 3.14
#define pb push_back
#define pp pop_back
int p=0;
void code(vector& a,vector& a11,int x,int sum,int n,int l){
if(sum==0){
/* for(auto j=0;j<a11.size();j++)
cout<<a11[j]<<" β€œ;
cout<<”\n";*/
if(p==0){
cout<<β€œYes”<<"\n";}
p=1;
return;
}
for(auto i=l;i<n;i++){
a11.pb(a[i]);
code(a,a11,x,sum+a[i],n,i+1);
a11.pp();
}
}
int main() {
int n,x,t;
cin>>t;
while(t–){
cin>>n;
vector a,a11;
for(int i=0;i<n;i++)
{
cin>>x;
a.pb(x);

}
code(a,a11,x,0,n,0);
if(p==0)
cout<<"No"<<"\n";
a.clear();
a11.clear();

p=0;
}
return 0;
}

Save ur code in coding blocks ide and send the link