Problem Statement: [this](https://mirror.codeforces.com/contest/1889/problem/B)↵
Is there a way to prove that if we are not able to connect the vertices to 1 in the greedy order that has been suggested, then there exists no other answer?↵
↵
Thanks.
Is there a way to prove that if we are not able to connect the vertices to 1 in the greedy order that has been suggested, then there exists no other answer?↵
↵
Thanks.
