#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
#define auto set<pi>:: iterator
using namespace std;
//using namespace __gnu_pbds;
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll const INF = 1e13;
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b)
{
ll n = a.size();
vector<pi> jelly(n);
for (ll i=0; i<n; ++i) jelly[i] = mp(a[i], b[i]);
sort(jelly.begin(), jelly.end());
vector<ll> prevv(x+1, INF);
prevv[0] = 0;
vector<ll> dp;
ll i;
for (i=0; i<n; ++i)
{
bool can = 0;
dp.assign(x+1, INF);
ll A = jelly[i].f, B = jelly[i].s;
for (ll j=0; j<=x; ++j)
{
dp[j] = prevv[j]+B;
if (j-A>=0) dp[j] = min(dp[j], prevv[j-A]);
if (dp[j]<=y) can = 1;
}
if (!can) break;
swap(dp, prevv);
}
return i;
}
