Minimum Priority Queue to sort activities in ascending order of finishing time ( f [ i ] ) .
priority_queue < pair < int , int > , vector < pair < int , int > > , greater < pair < int , int > > > p ; for ( int i = 0 ; i < s . size ( ) ; i ++ ) {