Brief description :
裸分数规划题一支。
/*
Author : xiaodao
Problem : POJ 2976. Dropping tests
Status : Accepted
Last Modify : GMT +8. Sept 8th 13:41.
*/
#include
#include
#include
using namespace std;
const double EPS = 1e-5;
const int N = 1000;
int a[N], b[N]; double c[N];
double l, r, m;
int n, k;
void init(){
for (int i=0;i 0) l = m;
else r = m;
}
printf("%.0lf\n", l*100);
}
}
