challenge activity

$17\mathrm{.}9\mathrm{.}2$: Complete the class that stores pairs $($count$,$ element$)$ where the count is incremented with each insertion.

$595628\mathrm{.}3923258.$qx$3$zqy$7$

Suppose you are trapped on a desert island with nothing but a priority queue, and you need to implement a stack. Complete the following class that stores pairs $($count$,$ element$)$ where the count is incremented with each insertion.

Recall that make$\_$pair$($count$,$ element$)$ yields a pair object, and that p$.$second yields the second component of a pair p$.$

The pair class defines an operator$<$ that compares pairs by their first component, and uses the second component only to break ties.