#include "jelly.h"
#include <bits/stdc++.h>
using namespace std;
int find_maximum_unique(int x, int y, vector<int> a, vector<int> b) {
int n = a.size();
vector<pair<int, int>> v(1);
for (int i = 0; i < n; i++) v.push_back({a[i], b[i]});
sort(v.begin(), v.end());
vector<vector<pair<int, int>>> dp(n+1, vector<pair<int, int>>(y+1, {0, x}));
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= y; j++) {
dp[i][j] = dp[i-1][j]; // don't buy it
if (dp[i][j].second >= v[i].first) // buy it from A
dp[i][j] = {dp[i-1][j].first+1, dp[i-1][j].second-v[i].first};
if (j >= v[i].second) { // buy it from B
if (dp[i][j].first < dp[i-1][j-v[i].second].first+1)
dp[i][j] = {dp[i-1][j-v[i].second].first+1, dp[i-1][j-v[i].second].second};
else if (dp[i][j].first == dp[i-1][j-v[i].second].first+1)
dp[i][j].second = max(dp[i][j].second, dp[i-1][j-v[i].second].second);
}
}
}
int ans = 0;
for (int i = 0; i <= y; i++) ans = max(ans, dp[n][i].first);
return ans;
}
