A certain program must store the names of all the people who finish the City Marathon. The names are entered by an official at the finish line as the competitors finish.

After the race is over the program must print a list only containing the names of competitors who placed $1$ to $10$ and then $100,200,300$ and so on$,$ as these competitors will receive a special medallion.

Which data structure would be the best choice for this program?

Pick ONE option

A vector or resizable array

L

A map $($implemented as a binary tree of key$/$value pairs$)$

A singly linked list

A hash set $($implemented as a hash table of keys$)$