The funny part was that he wasn't really good at this and we all doubted him.

Here's the solution in short: there are only a finite number of red-blue pairings and so at least one of them must have a minimum total line segment length, but if two segments crossed in that minimum pairing, you could switch the endpoints of those two segments and get a shorter total length.