knn.c

main() {
  int n, m, k, t=0, i;
  scanf("%d\n", &n);
  int s[n][2];

  for (i=0; i<n; i++)
    scanf("%d %c\n", &s[i][0], &s[i][1]);

  scanf("%d\n", &m);

  while (m--) {
    scanf("%d\n", &k);
    for (i=0; i<n; i++) {
      if ( abs(k - s[t][0]) > abs(k - s[i][0]) )
        t = i;
    }
    putchar(s[t][1]);
  }

  return 0;
}