CodeForces 735B Urbanization
来源:互联网 发布:io1.1鼠标淘宝哪家最好 编辑:程序博客网 时间:2024/05/24 02:33
题目大意:给你n个数,在这n个数中取n1个数和n2个数,求出平均值a1,a2,使他们的平均值和最大,将他们从大到小排列,分子越大,平均值就越大
#include<bits/stdc++.h>using namespace std;double array[100007];bool cmp(int x,int y){ return x>y;}int main(){ int n,n1,n2; cin>>n>>n1>>n2; if(n1>n2) swap(n1,n2); for(int i=0;i<n;i++) scanf("%lf",&array[i]); sort(array,array+n,cmp); double sum1=0.0,sum2=0.0; for(int i=0;i<n1;i++) sum1+=array[i]; for(int i=n1;i<n1+n2;i++) sum2+=array[i]; printf("%.8f\n",sum1/n1+sum2/n2);}
阅读全文
0 0
- 735 B. Urbanization codeforces
- codeforces 735B - Urbanization
- codeforces 735 B Urbanization
- CodeForces 735B Urbanization
- CodeForces 735B - Urbanization(贪心)
- Codeforces 735B - Urbanization 贪心
- Codeforces 735B Urbanization【水题】
- codeforces - 735B - Urbanization(贪心)
- codeforces 735 B.Urbanization (简单题)
- CodeForces 735 B.Urbanization(贪心)
- Codeforces Round #382 (Div. 2) 735B - Urbanization
- Codeforces Round #382 (Div. 2)-735B. Urbanization(贪心)
- Codeforces Round #382 (Div. 2) 735B Urbanization
- 【50.88%】【Codeforces round 382B】Urbanization
- Codeforces#382(Div. 2) B.Urbanization【贪心】
- Codeforces Round #382 (Div. 2) B. Urbanization
- Codeforces Round #382 (Div. 2) B. Urbanization
- B. Urbanization
- 洛谷 P3390 【模板】矩阵快速幂
- F2803X笔记——初始化与启动_#ifdef语句
- 洛谷3374 线段树2
- JavaScript类与封装
- Number Sequence(找规律,,,,,反正我没找到,递归超内存了....)
- CodeForces 735B Urbanization
- geotrellis使用(三十一)使用geotrellis直接将GeoTiff发布为TMS服务
- 响应式布局总结
- 火柴棍等式
- 7种Java单例模式
- Mybatis输入输出映射及动态sql
- 数组和指针的区别
- cygwin64 AutoMake 实例
- Java多线程(四)Lock锁