Codeforces Round #242 (Div. 2) B. Megacity
来源:互联网 发布:php from unixtime 编辑:程序博客网 时间:2024/06/15 11:31
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.
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).
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.
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
思路:贪心
#include <iostream>#include <cstdio>#include <cstring>#include <map>#include <algorithm>#include <cmath>using namespace std;const int maxn = 1010;const int inf = 1e6;map<double, int> mp;double dis(int x, int y) {return sqrt(x*x+y*y);}int main() {int n, s, x, y, k;scanf("%d%d", &n, &s);for (int i = 0; i < n; i++) {scanf("%d%d%d", &x, &y, &k);mp[dis(x, y)] += k;}map<double, int>::iterator it;double ans = -1;for (it = mp.begin(); it != mp.end(); it++) {if (s >= inf)break;s += it->second;ans = it->first;}if (s < inf)printf("-1\n");else printf("%.7lf\n", ans);}
- Codeforces Round #242 (Div. 2) B. Megacity
- Codeforces Round #242 (Div. 2) B. Megacity
- Codeforces Round #242 (Div. 2) B. Megacity
- codeforces#242B-Megacity-二分
- codeforces 424B Megacity
- Codeforces Round #242 (Div. 2) (A、B、C)
- Codeforces Round #131 (Div. 2) A B
- Codeforces Round #134 (Div. 2)B. Airport
- Codeforces Round #170 (Div. 2) problem B
- Codeforces Round #173 (Div. 2) Problem B
- Codeforces Round #181 (Div. 2) B. Coach
- Codeforces Round #185 (Div. 2)--A,B
- Codeforces Round #171 (Div. 2) B
- Codeforces Round #169 (Div. 2) B题
- Codeforces Round #188 (Div. 2) B题
- Codeforces Round #192 (Div. 2) B
- Codeforces Round #203 (Div. 2) B. Resort
- Codeforces Round #206 (Div. 2) - b
- java 导出并下载excel
- 获取MAC地址方法大全
- 西林街网盘搜索 千万亿网盘资源
- 如何使用 Xmanager 登录 Linux
- 【Hibernate】双向关联的oneTomany练习
- Codeforces Round #242 (Div. 2) B. Megacity
- gettimeofday和clock_gettime的不同
- Thymeleaf 首发教程 与 spring 整合
- 鸡为什么要过马路
- ArcMAp对线要素进行平滑处(打断)
- MD5算法原理
- Thymeleaf模板的使用
- 最近几天一点感悟
- 第9周项目3输出星号图(4)