POJ1328 Radar Installation （贪心）

Description

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.
Figure A Sample Input of Radar Installations

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.

题目大意是假设海岸线是一条无限延伸的直线。陆地在海岸线的一侧，而海洋在另一侧。每一个小的岛屿是海洋上的一个点。雷达坐落于海岸线上，只能覆盖d距离，所以如果小岛能够被覆盖到的话，它们之间的距离最多为d。题目要求计算出能够覆盖给出的所有岛屿的最少雷达数目。对于每个小岛，我们可以计算出一个雷达所在位置的区间。

思路
思路很简答就是一道区间覆盖求最小值的问题，典型的贪心问题，就是把雷达覆盖半径转化为小岛覆盖半径，然后求出与x坐标轴相交区间。

代码如下：

#include<stdio.h>
#include<algorithm>
#include<stdio.h>
#include<math.h>
using namespace std;
struct land
{
    double l,r;
} la[2000];//结构体储存区间的左右坐标。
int cmp(struct land a,struct land b)
{
    return a.l<b.l;
}//自定义比较规则
int main()
{
    int n,d;
    int sum=1;
    while(~scanf("%d %d",&n,&d)&&(n+d))
    {
        int i,x,y;
        int flag=0;
        for(i=0; i<n; i++)
        {
            scanf("%d %d",&x,&y);
            double t=sqrt(d*d-y*y);
           la[i].l=x-t;
           la[i].r=x+t;//求出小岛半径与x坐标轴的相交区间
            if(y>d)//有小岛不能覆盖到
                int flag=1;
        }
        if(flag)
        {
            printf("Case %d: -1\n",sum++);
            continue;
        }
        sort(la,la+n,cmp);
        double R=la[0].r;//去第一个区间的右端点来比较
        int count=1;
          for(i=1;i<n;i++)
        {
            if(la[i].l>R)//如果第二个区间和第一个区间不相交计数+1
            {
                count++;
                R=la[i].r;
            }
            else if(la[i].r<R)
                R=la[i].r;//第二个区间覆盖到了第一个区间，更新右端点位置
        }
        printf("Case %d: %d\n",sum,count);
        sum++;
    }
return 0;
}

这个代码是没有问题的，但是我在提交时语言选择了c++就出现了ce，然后改成G++就ac了，之后我去查找资料找到了原因。
提交题目是语言选择c++和G++的区别
我的主要错误就是在定义x，y为整型，但是aqrt计算出来的是double类型的，但是codeblocks会兼容这个错误，所以改成G++就过了。