牛客多校5 A-gpa(01分数规划)
2024-08-30 03:19:13
gpa
链接:https://www.nowcoder.com/acm/contest/143/A
来源:牛客网
时间限制:C/C++ 1秒,其他语言2秒
空间限制:C/C++ 262144K,其他语言524288K
Special Judge, 64bit IO Format: %lld
空间限制:C/C++ 262144K,其他语言524288K
Special Judge, 64bit IO Format: %lld
题目描述
Kanade selected n courses in the university. The academic credit of the i-th course is s[i] and the score of the i-th course is c[i].
At the university where she attended, the final score of her is
Now she can delete at most k courses and she want to know what the highest final score that can get.
输入描述:
The first line has two positive integers n,k The second line has n positive integers s[i] The third line has n positive integers c[i]
输出描述:
Output the highest final score, your answer is correct if and only if the absolute error with the standard answer is no more than 10
-5
输入例子:
3 1
1 2 3
3 2 1
输出例子:
2.33333333333
-->
备注:
1≤ n≤ 10
5
0≤ k < n 1≤ s[i],c[i] ≤ 10
3
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define MAX 100005
#define INF 0x3f3f3f3f
#define MOD 1000000007
using namespace std;
typedef long long ll; double s[MAX],c[MAX],cnt[MAX]; int main()
{
int n,k,i;
scanf("%d%d",&n,&k);
for(i=;i<=n;i++){
scanf("%lf",&s[i]);
}
for(i=;i<=n;i++){
scanf("%lf",&c[i]);
}
double l=,r=;
while(r-l>0.000001){
double mid=(l+r)/;
for(i=;i<=n;i++){
cnt[i]=s[i]*c[i]-mid*s[i];
}
sort(cnt+,cnt+n+);
double fx=;
for(i=k+;i<=n;i++){
fx+=cnt[i];
}
if(fx>=) l=mid;
else r=mid;
}
printf("%f\n",l);
return ;
}
最新文章
- LruCache算法原理及实现
- Spring面试问题
- Jmeter参数化的4种方法
- exec php
- Unity3d + UGUI 的多分辨率适配
- webapp 慎用setInterval、setTimeout
- QT开发pjsip的VOIP,A8平台运行
- UVALive 7148 LRIP 14年上海区域赛K题 树分治
- 很棒的jQuery代码片段分享
- iOS 6分享列表——UIActivityViewController详解
- Java入门——学会使用API
- WdatePicker-限制日期选择
- PHP全栈学习笔记7
- 常用数据库:MongoDB
- Python 冒泡排序、归并排序、快速排序
- tcp的三次握手,四次挥手
- webservice:com.sun.xml.internal.ws.server.ServerRtException: [failed to localize]
- Calendar抽象类的使用
- 当给DataGrid的Itemssoure属性赋值引起TabControl_SelectionChanged事件
- exam_review to M1
热门文章
- 九度OJ 1069:查找学生信息 (排序、查找)
- 九度OJ 1056:最大公约数 (GCD)
- Channel (digital image) 通道 色彩深度 Color_depth
- 在Linux下搭建我的世界(Minecraft)服务器
- laravel基础课程---12、lavarel的ajax操作2(lavarel的ajax使用总结)
- html5--1.18 div元素与布局
- kvm初体验之五:vm连接网络的两种方式:bridge和nat
- codeforces 659E E. New Reform(图论)
- 树莓派与 Python —— GPIO
- Git Shell Warning