C++ priority_queue sort elements descendingly
#include <iostream> #include <uuid/uuid.h> #include <ctime> #include <string> #include <sstream> #include <unistd.h> #include <fstream> #include <pthread.h> #include <queue> using namespace std; static char *uuidValue = (char *)malloc(40); static char *dtValue = (char *)malloc(20); char *getTimeNow() { time_t rawTime = time(NULL); struct tm tmInfo = *localtime(&rawTime); strftime(dtValue, 20, "%Y%m%d%H%M%S", &tmInfo); return dtValue; } void pqueue16(); int main() { pqueue16(); return 0; } void pqueue16() { priority_queue<int> pq; srand(time(NULL)); int rnd = 0; cout << "Original order" << endl; for (int i = 0; i < 100; i++) { rnd = rand() % 1000000; pq.push(rnd); cout << rnd << "\t"; } cout << endl << endl; cout << "Sort descendingly" << endl; for (int i = 0; i < 100; i++) { cout << pq.top() << "\t"; pq.pop(); } cout << endl << endl << "Finished in pqueue16() and now is " << getTimeNow() << endl; free(dtValue); free(uuidValue); }
Compile via
g++ -g -std=c++2a -I. h1.cpp -lpthread -o h1 -luuid
Run ./h1
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步