gorod

#include <iostream>
#include <map>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

int main() {
 map<string, int> city;
 int n,m;

 cout << '\n';
 string s;
 cin >> n;
 for (int i = 0; i < n; ++i)
 {
  cin >> s;
  cin >> m;
  city.insert(pair<string,int>(s, m));
 }
 cin >> s;
 map<string, int>::iterator it_s = city.find(s);
 map<string, int>::iterator it;
 vector<int> v;
 for (it = city.begin(); it != city.end(); ++it) {
  if ((*it).second < (*it_s).second)
   v.push_back((*it).second);
 }
 sort(v.begin(), v.end());
 for (int j = 0; j < v.size(); ++j){
  for (it = city.begin(); it != city.end(); ++it)
   if ((*it).second == v[j])
    cout << (*it).first << endl;
 }
 return 0;
}