随笔分类 -  排序、检索

摘要：最好还是用堆来维护吧，幸亏没超时。# include <stdio.h>int top, s[30005];int main(){ int n, h, i ,find, cur, mini; while (~scanf("%d", &n)) { top = 0; for (i = 1; i <= n; ++i) { scanf("%d", &h); find = 0; for (int i = 0; i < top; ++i) { ... 阅读全文