Deloitte | COGNIZANT | IBM | CAPGEMINI
import java.io.*;
import java.util.*;
class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int N=sc.nextInt();
int M=sc.nextInt();
int K=sc.nextInt();
int [] price=new int[N];
int[] protein=new int[N];
for(int i=0;i<N;i++){
price[i]=sc.nextInt();
}
for(int i=0;i<N;i++){
protein[i]=sc.nextInt();
}
int maxProtein = 0;
for (int mask = 0; mask < (1 << N); mask++) {
int[][] best= new int[N][2];
for (int i = 0; i < N; i++) {
best[i][0] = price[i];
best[i][1] = price[i] / 2;
}
PriorityQueue<int[]> pq = new PriorityQueue<>(
(a, b) -> (b[0] - b[1]) - (a[0] - a[1])
);
int currentPrice = 0;
int currentProtein = 0;
for (int i = 0; i < N; i++) {
if ((mask & (1 << i)) != 0) {
currentPrice +=best[i][0];
currentProtein += protein[i];
pq.add(new int[] {best[i][0], best[i][1]});
}
}
int coupons = 0;
while (coupons < K && !pq.isEmpty()) {
int[] option = pq.poll();
if (option[0] > option[1]) {
currentPrice -= (option[0] - option[1]);
coupons++;
}
}
if (currentPrice <= M) {
maxProtein = Math.max(maxProtein, currentProtein);
}
}
System.out.println(maxProtein);
}
}
//maximum protein value
1.7K ·