Connect cities

#include "iostream"
#include "vector"
#include "map"
#include "list"
#include "algorithm"


int main() {
    int n, m;
    std::cin >> n >> m;
    if (1 > n || n > 100000 || 1 > m || m > 200000) return EXIT_FAILURE;
    std::map<int, std::vector<int>> connections;
    int a, b;
    for (int i = 0; i < m; i ++) {
        std::cin >> a >> b;
        if ((1 <= a) && (a <= n) && (1 <= b) && (b <= n)) {
            connections[a].push_back(b);
            connections[b].push_back(a);
        }
    }
    std::vector<int> visited;
    std::vector<int> heads;
    for (int i = 1; i <= n; i++) {
        auto node = find(visited.begin(), visited.end(), i);
        if (node == visited.end()) {
            visited.push_back(i);
            heads.push_back(i);
        }
        sort(connections[i].begin(), connections[i].end());
        for (int elem : connections[i]) {
            visited.push_back(elem);
        }
    }
    int k = heads.size() - 1;
    std::cout << k << std::endl;
    for (int i = 0;  i < k; i++) {
        std::cout << heads[i] << " " << heads[i+1] << std::endl;
    }
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: ACCEPTED