Road Construction

星状图; 

#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <vector>

#define MAX 1005
#define INF 1e8
using namespace std;
int n, m;
int du[MAX];
vector<vector<int> >adj;
int main()
{
    cin>>n>>m;
    int a, b;
    adj.assign(n + 2, vector<int>() );
    memset(du, 0, sizeof(du));
    for(int i = 0; i < m; i++){
        cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
        du[b]++;
        du[a]++;
    }//puts("funking");
    int minD = INF, center = -1;
    for(int i = 1; i <= n; i++){
        if(minD > du[i]){
            minD = du[i];
            center = i;
        }
    }
    vector<pair<int, int> >ans;
    bool v[MAX];
    memset(v, 0, sizeof(v));
    int len = adj[center].size();


    for(int i = 0; i < len; i++){
        v[adj[center][i]] = 1;
    }
    for(int i = 1; i <= n; i++){
        if(i != center && v[i] == 0){
            int a = center, b = i;
            if( a > b)swap(a, b);
            ans.push_back( make_pair(a, b) );
        }
    }
    len = ans.size();
    cout<<ans.size()<<endl;
    for(int i = 0; i < len; i++){
        cout<<ans[i].first<<" "<<ans[i].second<<endl;
    }
	return 0;
}