Help Ramu Problem -Hackerblocks

Sir,what is the problem with this code.It passes all test cases except one:
#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<n;++i)
#define w(t) int t;cin>>t;while(t–)

int32_t main(int32_t argc, char const *argv[]) {

w(t){
int c1,c2,c3,c4,r,cab;
cin>>c1>>c2>>c3>>c4;
cin>>r>>cab;
int ri[r];int cabi[cab];
// For Rickshaw
int rop1 = 0;
int minR = INT_MAX;
rep(i,r){
cin>>ri[i];
rop1 += ri[i]*c1;
minR = min(c2+rop1,minR);
}

minR = min(min(c3,minR),rop1);

int cabop1 = 0;
int minC = INT_MAX;
rep(i,cab){
cin>>cabi[i];
cabop1 += cabi[i]*c1;
minC = min(c2+cabop1,minC);
}

minC = min(min(c3,minC),cabop1);

int ans = min(minC+minR,c4);
cout<<ans<<endl;

}

return 0;

}

this should have been rop1 += min(r1[i]*c1,c2);

and this should be minR = min(rop1,c3)

similar changes applied to cab cost as well

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.