Shopping TASK_021

#include<iostream>
using namespace std;

int cal(int cost[],int fin[],int k,int sum,int i,int n){
    if(i>=n){
        return sum;
    }
    int b = 0;
    if(k>=cost[i]){
        b = cal(cost,fin,k-cost[i],sum+fin[i],i+1,n);
    }
    int nb = cal(cost,fin,k,sum,i+1,n);
    return max(b,nb);
}

int main()
{
    int n,k;
    cin>>n>>k;
    int cost[n];
    int fin[n];
    for(int i=0;i<n;i++){
        cin>>cost[i]>>fin[i];
    }
    cout<<cal(cost,fin,k,0,0,n);
}