This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
coding_cheat_sheet [2020/10/08 00:33]
paul [Using Custom Data With Priority Queues]
coding_cheat_sheet [2020/10/08 00:34] (current)
paul [Using Custom Data With Priority Queues]
Line 291: Line 291:
 }; };
 +// This is a max heap based on number of the int in the pair, and if numbers are the same, word thats lower on the alphabetical compare wins.
 priority_queue<p_d, vector<p_d>, Compare> heap; priority_queue<p_d, vector<p_d>, Compare> heap;
 </code> </code>
  • coding_cheat_sheet.txt
  • Last modified: 2020/10/08 00:34
  • by paul