   ordered list problem
  Ok I need to make a list with 2 bits on infomation. "name" and "distance"How can I have it such that it is ordered from smallest to largest by distance.eg so I can have (or something to get the same result):mylist[0] being the place with the sortest distancesmylist[1] being the place with the next shortest distance etcI thought about useing a priority_queue but I'm  not sure there how I'd go about making it smallest to greatest and how I'd store both the distance and the name in it.   
  if you need to sort something easily consider writing simple bubble sort(ask google) function that would sort your array. i don`t know if there is something in c++ already, maybe someone else will tell you   ;  Depending on how this container is used std::multimap may be appropriate.  This link describes std::multimap a little bit and has an example on use.  So this may work:std::multimap<int, std::string> m;m.insert(pair<int, std::string>(20, "Detroit"));m.insert(pair<int, std::string>(20, "Washington"));m.insert(pair<int, std::string>(40, "Chicago"));m.insert(pair<int, std::string>(10, "London"));for (multimap<int, std::string>::iterator it = m.begin(); it != m.end(); ++it){   cout << "  [" << (*it).first << ", " << (*it).second << "]" << endl;}I would read up on this container a little bit before really using it so you don't get bitten in case it doesn't do what you want.   