Lunch in Grid City - UVa 855

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int st[50010], av[50010];

int main () {
    int tc;
    int s,a,f;
    scanf("%d",&tc);
    while(tc--) {
        scanf("%d %d %d",&s,&a,&f);
        for(int i = 0; i < f; ++i) {
            scanf("%d %d",&s,&a);
            st[i]=s; av[i]=a;
        }
        sort(st,st+f);
        sort(av,av+f);
        printf("(Street: %d, Avenue: %d)\n",st[(f-1)/2], av[(f-1)/2]);
    }
    return 0;
}