最快
2026-10-31 20:50:20
发布于:内蒙古
6阅读
0回复
0点赞
#include <cstdio>
inline int read() {
int x = 0; char c = getchar();
while (c < '0' || c > '9') c = getchar();
while (c >= '0' && c <= '9') x = x*10 + (c^48), c = getchar();
return x;
}
int h[100005], m;
int main() {
int n = read(); m = read();
for (int i = 1; i <= m; i++) h[i] = read(); // 前m个直接进堆
for (int i = m >> 1; i >= 1; i--) { // Floyd建堆 O(m)
int j = i;
while (2*j <= m) {
int k = 2*j;
if (k+1 <= m && h[k+1] < h[k]) k++;
if (h[j] <= h[k]) break;
int t = h[j]; h[j] = h[k]; h[k] = t;
j = k;
}
}
for (int i = m + 1; i <= n; i++) { // 剩余n-m个
h[1] += read(); // 最早空闲水龙头接新人
int j = 1; // down(1) 内联
while (2*j <= m) {
int k = 2*j;
if (k+1 <= m && h[k+1] < h[k]) k++;
if (h[j] <= h[k]) break;
int t = h[j]; h[j] = h[k]; h[k] = t;
j = k;
}
}
int ans = 0;
for (int i = 1; i <= m; i++) if (h[i] > ans) ans = h[i];
printf("%d\n", ans);
return 0;
}
其实是AI
这里空空如也








有帮助,赞一个