如何根据另一个预先排序的字符串向量排序包含字符串的向量？

Question

So the program will take in a user's name then ID and store them in vectors vName and vID. For example i have a code like this that takes a string name

cout << "what is your name?";
getline(cin sName)
vName.push_back(sName)

 cout << "what is your name?";
 getline(cin sName)
 vName.push_back(sName)

If a user inputs the names Paul and Leto and the IDs 123 and 456 and if i cout the elements inside the vectors i'll get them back exactly as i put them in. But if i decide to sort vName like this

(vName.begin(), vName.end());  

and i cout the elements Leto will be matched with 123 and Paul will be matched with 456. How do i prevent that from happening? How do i make it so that no matter how vName is sorted vID will change so that the IDs will match with the names?

Answer 1

You should use a struct:

struct Person {
  string name;
  int id;
};
vector<Person> people;

If you don't like that, you could do "proxy sorting" by sorting your ID vector first using the names as the proxy for ordering. In either of these solutions you will need to implement your own predicate for sorting by the name field.