G. Tree Reconstruction

http://codeforces.com/gym/101911/problem/G 

题意：删除边i能使得两个互不连通的最大节点为x，y；构造这样的树，不行就输出NO；

思路：必定有一个最大点位n；所以每次都和n连，当遇到相同的点就看有没有小与该点的节点，有就是要插进她们之间，没有则无解；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=1e9+7;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

set<int> s;
int a[maxn],ans[maxn];
int main()
{
    int n;
    cin>>n;
    bool f=1;
    for(int i=1;i<=n-1;i++)
    {
        int x,y;
        cin>>x>>y;
        if(x!=n&&y!=n) f=0;
        a[i]=min(x,y);
        s.insert(i);
    }
    s.insert(n);
    if(!f)
    {
        cout<<"NO"<<endl;
        return 0;
    }
    sort(a+1,a+n);
    ans[1]=a[1];
    s.erase(a[1]);
    for(int i=2;i<n;i++)
    {
        if(a[i]==a[i-1])
        {
            if(*s.begin()>a[i])
            {
                cout<<"NO"<<endl;
                return 0;
            }
            else
            {
                ans[i]=*s.begin();
                s.erase(*s.begin());
            }
        }
        else
        {
            ans[i]=a[i];
            s.erase(a[i]);
        }
    }
    ans[n]=n;
    cout<<"YES"<<endl;
    for(int i=1;i<=n-1;i++)
    {
        cout<<ans[i]<<" "<<ans[i+1]<<endl;
    }
    return 0;
}