https://code.google.com/codejam/contest/32016/dashboard#s=p0
I'm solving this problem and found a solution but I can't prove my solution's correctness. Is there anyone can prove this? My solution is below: 1. Sort two vectors. Two vectors becomes (x1, ..., xn), (y1, ..., yn) 2. Minimum product is x1 yn + x2 yn-1 + ... + xn y1 -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/0b8deb78-0bf9-46c6-a9c4-d20cd8af3ecd%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
