CSES School Dance: You have boys and girls. Some boy-girl pairs are willing to dance together. Find the maximum number of boy-girl dance pairs for the school dance. This is a textbook maximum bipartite matching problem.
Boys form one group, girls form the other, and edges represent pairs willing to dance. You will implement Kuhn's algorithm to solve this. Constraints are with up to potential pairs.