LightOj 1016 - Brush (II) 排序贪心

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<sstream>
#include<cmath>
#include<climits>
#include<string>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#include<set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
#define pb(a) push(a)
#define INF 0x1f1f1f1f
#define lson idx<<1,l,mid
#define rson idx<<1|1,mid+1,r
#define PI  3.1415926535898
template<class T> T min(const T& a,const T& b,const T& c) {
    return min(min(a,b),min(a,c));
}
template<class T> T max(const T& a,const T& b,const T& c) {
    return max(max(a,b),max(a,c));
}
void debug() {
#ifdef ONLINE_JUDGE
#else

    freopen("d:\\in1.txt","r",stdin);
    freopen("d:\\out1.txt","w",stdout);
#endif
}
int getch() {
    int ch;
    while((ch=getchar())!=EOF) {
        if(ch!=‘ ‘&&ch!=‘\n‘)return ch;
    }
    return EOF;
}
int y[55555];
int main()
{
    int t;
    scanf("%d",&t);
    for(int ca=1;ca<=t;ca++)
    {
        int n,w;
        scanf("%d%d",&n,&w);
        for(int i=0;i<n;i++)
            scanf("%*d%d",&y[i]);
        sort(y,y+n);

        int cur=INT_MIN;
        int res=0;
        for(int i=0;i<n;i++)
        {
            if(y[i]<=cur)continue;
            cur=y[i]+w;
            res++;
        }
        printf("Case %d: %d\n",ca,res);
    }
    return 0;
}