经典模板题,要求留下 n − k n-k n−k 个 二元组 ( a , b ) (a,b) (a,b), 使得 ∑ i = 1 n − k a i ∑ i = 1 n − k b i \frac{\sum_{i=1}^{n-k}{a_i}}{\sum_{i=1}^{n-k}{b_i}} ∑i=1n−kbi∑i=1n−kai 最大
很显然答案具有单调性
那么我们直接二分答案
对于一个可能的答案 x x x, 怎么判断它是否可行?
是不是也很简单,设 y i = a i − x ∗ b i y_i=a_i-x*b_i yi=ai−x∗bi,将 y i y_i yi 按降序排列,然后判断 ∑ i = 1 n − k y i \sum\limits_{i=1}^{n-k}y_i i=1∑n−kyi ,是正就可行
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 100010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-15 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
double a[N], b[N], y[N] ;
int n, k ;
bool cmp(double a, double b) {
return a > b ;
}
int check(double x) {
rep(i, 1, n) y[i] = a[i] - x * b[i] ;
sort(y + 1, y + n + 1, cmp) ;
double sum = 0 ;
rep(i, 1, n - k) sum += y[i] ;
return sum >= 0 ;
}
signed main(){
while (scanf("%d%d", &n, &k) != EOF && n + k) {
rep(i, 1, n) scanf("%lf", &a[i]) ;
rep(i, 1, n) scanf("%lf", &b[i]) ;
double l = 0, r = iinf, mid ;
while (r - l > eps) {
mid = l + (r - l) / 2 ;
if (check(mid)) l = mid ;
else r = mid ;
}
printf("%.0lf\n", l * 100) ;
}
return 0 ;
}
/*
写代码时请注意:
1.ll?数组大小,边界?数据范围?
2.精度?
3.特判?
4.至少做一些
思考提醒:
1.最大值最小->二分?
2.可以贪心么?不行dp可以么
3.可以优化么
4.维护区间用什么数据结构?
5.统计方案是用dp?模了么?
6.逆向思维?
*/