#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;
long long a[10005];
int dowork() {
int n, m, k;
scanf("%d%d%d", &n, &m, &k);
for (int i = 0; i < n; ++i) {
scanf("%lld", &a[i]);
}
sort(a, a + n);
for (int i = 0; i < n; ++i) {
if (a[i] > m) {
if (i == 0 || a[i - 1] + k < a[i]) {
return 0;
}
if ((m = a[i - 1] + k) >= a[n - 1]) {
return 1;
}
k--;
}
}
return 1;
}
int main() {
int cas;
scanf("%d", &cas);
for (int i = 1; i <= cas; ++i) {
printf("Case #%d:\n%s\n", i, dowork() == 1 ? "why am I so diao?" : "madan!");
}
return 0;
}
HDU 5246 超级赛亚ACMer —— 贪心
最新推荐文章于 2022-07-18 11:13:26 发布