>> But I dont need that so whats the alternative ??
If you don't care what order they're in, then you should still use the map and let it order them.
If you don't want them to be in alphabetical order, but any other seemingly random order will do, then you can use a hash table (like unordered_map) which will allow fast lookups without ordering the elements.
If you want them to be in the same order you insert them, then you'll have to use a vector (or maybe a deque or list) and combine the key and value into a single struct. The problem is then that you won't be able to do lookups quickly because the entire container will have to be searched. If you don't plan on doing lookups, then this shouldn't be a problem.
If you want fast lookups and specific ordering, then you'll need some combination of containers to hold that information.