标签:hdu1425
5 3 3 -35 92 213 -644
213 92 3请用VC/VC++提交HintHint
#include <stdio.h> #include <algorithm> #define maxn 1000002 using namespace std; int arr[maxn]; int main() { int n, m, i; while(scanf("%d%d", &n, &m) == 2){ for(i = 0; i < n; ++i) scanf("%d", &arr[i]); make_heap(arr, arr + n); printf("%d", arr[0]); for(i = 0; i < m - 1; ++i){ pop_heap(arr, arr + n - i); printf(" %d", arr[0]); } printf("\n"); } return 0; }
HDU1425 sort 【STL堆排序】,布布扣,bubuko.com
标签:hdu1425
原文地址:http://blog.csdn.net/chang_mu/article/details/38640711