1900分图论？E - Tree Reconstruction 思维+构造

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n ;
struct node{
    int x, y;
    bool operator < (const node& no) const {
        return x < no.x;
    }
}lt[1005];
int cnt = 0, buck[1005];
int ans[1005], vis[1005];
int main(void)
{
    CLOSE;
    cin >> n;
    for (int i = 1 ; i < n ; i ++)
    {
        cin >> lt[i].x >> lt[i].y;
        if(lt[i].x > lt[i].y)
            swap(lt[i].x, lt[i].y);
        if(lt[i].x == n || lt[i].y == n)
            cnt += 1;
    }
    if(cnt != n-1)
    {
        cout << "NO" << endl;
        return 0;
    }
    sort(lt+1,lt+n);
    ans[n] = n;
    for (int i = 1 ; i < n ; i ++)
    {
        if(!vis[lt[i].x])
        {
            vis[lt[i].x] = 1;
            ans[i] = lt[i].x;
        }
        else
        {
            for (int j = 1 ; j < lt[i].x ; j ++)
            {
                if (!vis[j])
                {
                    vis[j] = 1;
                    ans[i] = j;
                    break;
                }
            }
        }
        if(!ans[i])
        {
            cout << "NO" << endl;
            return 0;
        }
    }
    cout << "YES" << endl;
    for (int i = 1 ; i < n ; i ++)
        cout << ans[i] << ' ' << ans[i+1] << endl;
}