


"""simple docstring"""






import heapq
def       A_   (   _lowerCAmelCase     :					dict       ):






     """simple docstring"""

     _a    	=				[]

     # for each node and his adjacency list add them and the rank of the node to queue
     # using heapq module the queue will be filled like a Priority Queue
     # heapq works with a min priority queue, so I used -1*len(v) to build it
     for key, value in graph.items():
          # O(log(n))
          heapq.heappush(_lowerCAmelCase,     [-1 * len(_lowerCAmelCase       ), (key, value)]       )

     # chosen_vertices = set of chosen vertices
     _a    	=				set()

     # while queue isn't empty and there are still edges
     #   (queue[0][0] is the rank of the node with max rank)
     while queue and queue[0][0] != 0:
          # extract vertex with max rank from queue and add it to chosen_vertices
          _a    	=				heapq.heappop(_lowerCAmelCase       )[1][0]
          chosen_vertices.add(_lowerCAmelCase       )

          # Remove all arcs adjacent to argmax
          for elem in queue:
               # if v haven't adjacent node, skip
               if elem[0] == 0:
                    continue
               # if argmax is reachable from elem
               # remove argmax from elem's adjacent list and update his rank
               if argmax in elem[1][1]:
                    _a    	=				elem[1][1].index(_lowerCAmelCase       )
                    del elem[1][1][index]
                    elem[0] += 1
        # re-order the queue
          heapq.heapify(_lowerCAmelCase       )
     return chosen_vertices


if __name__ == "__main__":
   import doctest

   doctest.testmod()

   __snake_case							=       {0: [1, 3], 1: [0, 3], 2: [0, 3, 4], 3: [0, 1, 2], 4: [2, 3]}
   print(f'Minimum vertex cover:\n{greedy_min_vertex_cover(graph)}')



"""simple docstring"""






from typing import Any
def       A_   (   _lowerCAmelCase     :					list       ):






     """simple docstring"""

     if not input_list:
          return []
     _a    	=				[input_list.count(_lowerCAmelCase       ) for value in input_list]
     _a    	=				max(_lowerCAmelCase       )  # Gets the maximum count in the input list.
     # Gets values of modes
     return sorted({input_list[i] for i, value in enumerate(_lowerCAmelCase       ) if value == y}       )


if __name__ == "__main__":
   import doctest

   doctest.testmod()