Connect cities

input/code.cpp: In function 'int main()':
input/code.cpp:20:9: error: 'queue' was not declared in this scope
   20 |         queue<int> q;
      |         ^~~~~
input/code.cpp:3:1: note: 'std::queue' is defined in header '<queue>'; did you forget to '#include <queue>'?
    2 | #include <algorithm>
  +++ |+#include <queue>
    3 | 
input/code.cpp:20:15: error: expected primary-expression before 'int'
   20 |         queue<int> q;
      |               ^~~
input/code.cpp:26:5: error: 'q' was not declared in this scope
   26 |     q.push(1);
      |     ^
input/code.cpp:47:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for(int i = 0; i < addNodes.size(); i++) {
      |                    ~~^~~~~~~~~~~~~~~~~

#include <iostream>
#include <algorithm>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<vector<int>> adj(n+1);
    vector<int> addNodes;

    for(int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }

    while(true) {
        queue<int> q;
    bool visited[n];
    int distance[n];

    visited[1] = true;
    distance[1] = 0;
    q.push(1);
    while (!q.empty()) {
        int s = q.front(); q.pop();
        // process node s
        for (auto u : adj[s]) {
            if (visited[u]) continue;
            visited[u] = true;
            distance[u] = distance[s]+1;
            q.push(u);
        }
    }

    for(int i = 1; i <= n; i++) {
        if(!visited[i]) {
            adj[1].push_back(i);
            adj[i].push_back(1);
            addNodes.push_back(i);
            break;
        }
    }

    for(int i = 0; i < addNodes.size(); i++) {
       cout << addNodes[i] << " " << 1 << endl;
    }
    return 0;


}
}