int backtracking(int res, int i){
    if(i >= v.size()){
        if(res <= n) {
            return res;
        } else{
            return INT_MIN;
        }
    }
    return max(backtracking(res+v[i], i+1),
               backtracking(res, i+1));
}