Radar Installation POJ - 1328 雷达安装 贪心

Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.

We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.

Input The input consists of several test cases. The first line of each case contains two integers n (1<=n<=1000) and d, where n is the number of islands in the sea and d is the distance of coverage of the radar installation. This is followed by n lines each containing two integers representing the coordinate of the position of each island. Then a blank line follows to separate the cases.

The input is terminated by a line containing pair of zeros

Output

For each test case output one line consisting of the test case number followed by the minimal number of radar installations needed. “-1” installation means no solution for that case.

Sample Input

3 2

1 2

-3 1

2 1

1 2

0 2

0 0

Sample Output

Case 1: 2

Case 2: 1

这道题目的意思是指x轴上可以安装雷达，可以观测周围以d为半径的圆的距离。有n个小岛，给出这n个小岛的坐标，问最少需要多少个雷达才能监测所有小岛。如果超出了范围，输出-1.
这道题目的重点在排序上，如果不加思考，肯定就按x轴的大小进行排序了，但是这样是不对的，

如图所示

如果以第一个点画圆，那么第二个不一定落到第一个圆上；
所以排序要以这个小岛的坐标所在x轴呈现的圆的原点进行排序，这样就不会出现刚才的那种情况了。这样进行排序后，就可以只遍历一遍了，比较当前的小岛的位置和当前雷达的位置，如果不能覆盖，就++，然后更新新的雷达的位置。

代码如下；

#include<stdio.h>
#include<string.h>
#include<algorithm>
#