0/1分数规划入门题.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
const double eps = 1e-10;
const ll inf = 1e18;
double ans = 0;
int n, k;
inline ll read()
{
ll s = 0, w = 1;
char ch = getchar();
while (ch < 48 || ch >