Strange Lunchbox

#include <iostream>
using namespace std;

long long v[301][601][601];
long long  a[301],b[301];

int main()
{
    long long  n,i,max1,j,k,x,y;
    cin>>n>>x>>y;
    for(i=1;i<=n;i++){
        cin>>a[i]>>b[i];
    }
     for(i=0;i<=n;i++){
        for(j=0;j<=600;j++){
            for(k=0;k<=600;k++){
                v[i][j][k]=99999;
            }
        }
        v[i][0][0]=0;
     }

    for(i=1;i<=n;i++){
        for(j=300;j>=0;j--){
            for(k=300;k>=0;k--){
                v[i][j+a[i]][k+b[i]]=min(v[i-1][j+a[i]][k+b[i]],v[i-1][j][k]+1);
            }
        }
    }
    max1=99999;
    for(j=x;j<=600;j++){
        for(k=y;k<=600;k++){
                max1=min(v[n][j][k],max1);
        }
    }
    if(max1<99999)
        cout<<max1;
    else
        cout<<"-1";
    return 0;
}