32d31
< #include "mem/gems_common/PrioHeap.hh"
73c72
< PrioHeap<const AccessTraceForAddress*> heap;
---
> std::vector<const AccessTraceForAddress *> sorted;
80c79
< heap.insert(record);
---
> sorted.push_back(record);
81a81
> sort(sorted.begin(), sorted.end(), AccessTraceForAddress::less_equal);
109,110c109,111
< while (heap.size() > 0 && counter < records_printed) {
< const AccessTraceForAddress* record = heap.extractMin();
---
> int max = sorted.size();
> while (counter < max && counter < records_printed) {
> const AccessTraceForAddress* record = sorted[counter];
120,121c121,122
< while (heap.size() > 0) {
< const AccessTraceForAddress* record = heap.extractMin();
---
> while (counter < max) {
> const AccessTraceForAddress* record = sorted[counter];