i am getting WA test 6. Here is the Problem. Here is also my submission.. it should be a simple problem but i don't know why am i getting wrong answer. my approach for maximum isolated nodes is to make a fully connected graph with k nodes that will take all of the m edges.