your code does found the optimal solution though it sorts by ranks.
Eg:
your output
1
3 3
Case #1: 4
6 2
5 2
4 1
3 1
optimal solution would be
1
3 3
Case #1: 3
2 5
2 2
3 5
On Monday, April 20, 2020 at 10:08:09 PM UTC+5:30, Atif Hussain wrote:
>
> Hi,
> For Google CodeJam 2020 Round 1B - 3.JoinT
Thanks.
On Tue, 21 Apr, 2020, 9:51 PM PAGADALA SAINADTH,
wrote:
> your code does found the optimal solution though it sorts by ranks.
> Eg:
> your output
> 1
> 3 3
> Case #1: 4
> 6 2
> 5 2
> 4 1
> 3 1
> optimal solution would be
> 1
> 3 3
> Case #1: 3
> 2 5
> 2 2
> 3 5
>
>
>
> On Monday, April 2
