Megacity
来源:互联网 发布:淘宝到货多久确认收货 编辑:程序博客网 时间:2024/06/11 08:08
Description
The administration of the Tomsk Region firmly believes that it's time to become a megacity (that is, get population of one million). Instead of improving the demographic situation, they decided to achieve its goal by expanding the boundaries of the city.
The city of Tomsk can be represented as point on the plane with coordinates (0;0). The city is surrounded with n other locations, the i-th one has coordinates (xi,yi) with the population ofki people. You can widen the city boundaries to a circle of radiusr. In such case all locations inside the circle and on its border are included into the city.
Your goal is to write a program that will determine the minimum radius r, to which is necessary to expand the boundaries of Tomsk, so that it becomes a megacity.
Input
The first line of the input contains two integers n ands (1 ≤ n ≤ 103;1 ≤ s < 106) — the number of locatons around Tomsk city and the population of the city. Thenn lines follow. The i-th line contains three integers — the xi andyi coordinate values of thei-th location and the number ki of people in it (1 ≤ ki < 106). Each coordinate is an integer and doesn't exceed104 in its absolute value.
It is guaranteed that no two locations are at the same point and no location is at point (0; 0).
Output
In the output, print "-1" (without the quotes), if Tomsk won't be able to become a megacity. Otherwise, in the first line print a single real number — the minimum radius of the circle that the city needs to expand to in order to become a megacity.
The answer is considered correct if the absolute or relative error don't exceed10 - 6.
Sample Input
4 9999981 1 12 2 13 3 12 -2 1
2.8284271
4 9999981 1 22 2 13 3 12 -2 1
1.4142136
2 11 1 9999972 2 1
-1
题意:要把tom弄成一个big city,即人口数大于1000000,告诉你它周边有几个城市和人口数,要你圈出满足条件的最短半径
我们可以将距离从小到大排序 然后一个个city人口相加 当人口数达标时输出那个距离 就是要求的最短的半径距离
#include<stdio.h>#include<string.h>#include<math.h>#include<iostream>#include<algorithm>using namespace std;#define Max 1000000struct ac{ int x,y,p; double distant;}city[1100];bool operator<(const ac& a,const ac& b){ return a.distant<b.distant;}int n,s;int main(){ double ans; while(~scanf("%d%d",&n,&s)) { int i; for(i=0;i<n;i++) { scanf("%d%d%d",&city[i].x,&city[i].y,&city[i].p); city[i].distant=sqrt(double(city[i].x*city[i].x+city[i].y*city[i].y)); } sort(city,city+n); ans=0; bool flag=0; for(i=0;i<n;i++) { s+=city[i].p; ans=city[i].distant; if(s>=Max) { flag=1; break; } } if(flag) printf("%.7lf\n",ans); else puts("-1"); }}
- Megacity
- B. Megacity
- 424 B. Megacity
- codeforces 424B Megacity
- codeforces#242B-Megacity-二分
- Codeforces Round #242 (Div. 2) B. Megacity
- Codeforces Round #242 (Div. 2) B. Megacity
- Codeforces Round #242 (Div. 2) B. Megacity
- duilib中ListCtrl控件的实现
- 仿酷狗音乐播放器开发日志七——播放列表的实现二
- 暑期学习计划
- python 的repr和str以及“”
- 山东分公司的风格岁的法国方法
- Megacity
- 仿酷狗音乐播放器开发日志八——播放列表的实现三
- bzoj1046上升序列 DP+记录路径
- libevent 事件通知
- (一)u-boot2013.01.01 for s5pv210:《Uboot简介》
- Ajax 异步处理 servlet 交互
- 开篇
- hdoj 1161 Eddy's mistakes
- hdu 2043 密码