Atcoder Weekday Contest 073

int res;
auto mint = [](){
    int n,m; cin >> n >> m;
    map<int, int> M;
    for(int i = 0; i < n; i++){
        int x; cin >> x; M[x]++;
    }
    for(int i = 0; i < m; i++){
        int x; cin >> x; res += (M.count(x));
    }
    cout << res << "\n";
};

int n,k,mx;
 
auto mint = [](){
    cin >> n >> k;
    vector<array<int, 2>> w(n);
    for(int i = 0; i < n; i++) cin >> w[i][0] >> w[i][1];
    vector<int> v;
    for(int i = 0; i < n; i++) v.pb(i < k ? 0 : 1);
    do{
        int s = 0;
        for(int i = 0; i < n; i++) s += (v[i] ? w[i][0] : w[i][1]);
        mx = max<int>(mx, s);
    }while(next_permutation(all(v)));
    cout << mx << "\n";
};

int q,n,m,res;
constexpr int inf = 1LL << 50;
 
auto mint = [](){
    cin >> q >> n >> m;
    vector<vector<int>> dist(n + 1, vector<int>(n + 1, inf));
    for(int i = 0; i < m; i++){
        int a,b,c; cin >> a >> b >> c;
        dist[a][b] = dist[b][a] = c;
    }
    for(int i = 1; i <=n; i++) dist[i][i] = 0;
    for(int k = 1; k <=n; k++) for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++){
            dist[i][j] = min<int>(dist[i][j], dist[i][k] + dist[k][j]);
    }
    while(q--){
        int a,b; cin >> a >> b;
        res += dist[a][b];
    }
    cout << res << "\n";
};