#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define sc second
const int MAXN = 2005, MAX = 1e4+5;
int dp[MAXN][MAX];
vector< pair<int,int> > v;
bool cmp(pair<int,int> a, pair<int,int> b){
int ma = min(a.fi,a.sc), mb = min(b.fi,b.sc);
return ma < mb;
}
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int n = a.size();
for(int i = 0; i < n; i++)v.push_back({a[i],b[i]});
sort(v.begin(),v.end(),cmp);
int ans = 0;
for(int i = 1; i <= n; i++){
for(int j = 0; j <= x; j++){
dp[i][j] = dp[i-1][j]+v[i-1].sc;
if(j >= v[i-1].fi) dp[i][j] = min(dp[i][j], dp[i-1][j - v[i-1].fi]);
}
if(dp[i][x] <= y)ans = i;
}
return ans;
}
