#include<bits/stdc++.h>
int dp[10010];
//least x spent with y(i) spent
int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {
std::vector<std::pair<int,int>> comb;
for(int i=0;i<a.size();i++){
comb.push_back({a[i],b[i]});
}
std::sort(comb.begin(),comb.end());
int jelly=0;
for(auto [ca,cb]:comb){
for(int i=y;i>=0;i--){
dp[i]=dp[i]+ca;
if(i>=cb){
//std::cout << cb << '*';
dp[i]=std::min(dp[i],dp[i-cb]);
}
//std::cout << dp[i] << ' ';
}//std::cout << '\n';
bool pos=false;
for(int i=0;i<=y;i++){
if(dp[i]<=x)pos=true;
}
if(!pos)break;
jelly+=1;
}
return jelly;
}
