Codeforces Round #451 (Div. 2) D - Alarm Clock 双指针+贪心

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e6+7, maxd = 1e6;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

int n, m, k;
int a[maxn];

int main() {
    memset(a, 0, sizeof a);
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1; i <= n; ++i) {
        int x; 
        scanf("%d", &x);
        a[x] = 1;
    }
    int sum = 0, ans = 0, l_ = 1, r_ = m;
    for(int i = 1; i <= m; ++i)
        sum += a[i];
    if(sum >= k) {
        int t = (sum - k + 1);
        for(int i = m; ; --i) {
            if(a[i]) {
                a[i] = 0;
                t--;
                ans++;
            }
            if(!t) break;
        }
        sum = k-1;
    }

    for( ; r_ <= maxd; ) {
        if(sum >= k) {
            ans++;
            a[r_] = 0;
            sum--;
        }
        if(a[l_]) sum --;
        l_ ++; r_ ++;
        if(a[r_]) sum ++;
    }
    printf("%d\n", ans);

    return 0;
}