Transport Tracer Graph Problem (Print Data) using C++

#include <bits/stdc++.h>

using namespace std;

/**

    Sample Input:

    4
    JUU 2
    JFK 3
    JER 3
    JRU 2
    JFK 2 JER 3
    JUU 2 JER 1 JRU 18
    JUU 3 JFK 1 JRU 3
    JFK 18 JER 3
    JUU JRU

*/

vector<vector<int>> a;
vector<vector<int>> cost;
vector<string> country;
vector<int> connected;

int Convert(string s) {
    for (int i = 0; i < (int) country.size(); i++) {
        if (s == country[i]) {
            return i;
        }
    }
}

int main() {
    int n;
    cin >> n;
    country = vector<string>(n);
    connected = vector<int>(n);
    for (int i = 0; i < n; i++) {
        cin >> country[i] >> connected[i];
    }
    a = vector<vector<int>>(n);
    cost = vector<vector<int>>(n, vector<int>(n, 0));
    for (int u = 0; u < n; u++) {
        for (int j = 0; j < (int) connected[u]; j++) {
            string name;
            int weight;
            cin >> name >> weight;
            int v = Convert(name);
            a[u].emplace_back(v);
            cost[u][v] = weight;
        }
    }
    string start, end;
    cin >> start >> end;
    cout << "\nConnected Cities\n";
    for (int u = 0; u < n; u++) {
        cout << u << " : " << country[u];
        for (int v = 0; v < (int) a[u].size(); v++) {
            cout << " -> " << a[u][v] << " : " << country[a[u][v]];
        }
        cout << '\n';
    }
    cout << "\nCost of Travel\n";
    for (int u = 0; u < n; u++) {
        cout << '\t' << u;
    }
    cout << '\n';
    for (int u = 0; u < n; u++) {
        cout << u;
        for (int v = 0; v < n; v++) {
            cout << '\t' << cost[u][v];
        }
        cout << '\n';
    }
    return 0;
}