C++ effective approach to container for one-time lookup but multiple traverses and accesses

Question

When building the array/vector from elements in my problem, I need to check if they are not already inserted, i.e., not allow duplicates. Instead of using array/vector I can use