CodeForces - 366C（2020.4.19训练A题）

Problem
Dima, Inna and Seryozha have gathered in a room. That’s right, someone’s got to go. To cheer Seryozha up and inspire him to have a walk, Inna decided to cook something.

Dima and Seryozha have n fruits in the fridge. Each fruit has two parameters: the taste and the number of calories. Inna decided to make a fruit salad, so she wants to take some fruits from the fridge for it. Inna follows a certain principle as she chooses the fruits: the total taste to the total calories ratio of the chosen fruits must equal k. In other words, , where a j is the taste of the j-th chosen fruit and b j is its calories.

Inna hasn’t chosen the fruits yet, she is thinking: what is the maximum taste of the chosen fruits if she strictly follows her principle? Help Inna solve this culinary problem — now the happiness of a young couple is in your hands!

Inna loves Dima very much so she wants to make the salad from at least one fruit.

Input
The first line of the input contains two integers n, k (1 ≤ n ≤ 100, 1 ≤ k ≤ 10). The second line of the input contains n integers a 1, a 2, …, a n (1 ≤ a i ≤ 100) — the fruits’ tastes. The third line of the input contains n integers b 1, b 2, …, b n (1 ≤ b i ≤ 100) — the fruits’ calories. Fruit number i has taste a i and calories b i.

Output
If there is no way Inna can choose the fruits for the salad, print in the single line number -1. Otherwise, print a single integer — the maximum possible sum of the taste values of the chosen fruits.

题意：给定n种水果的taste和calories值，还有k，要求从中选择若干种水果符合taste总和/calories总和=k，输出符合要求中最大的taste值

选法不连续多样，每种只能选一次，容易联想到01背包，剩下的工作就是将公式化简量化成数据即可，详见代码

AC代码

#include<iostream>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
const int maxn =