Submission for B2=> https://mirror.codeforces.com/contest/1995/submission/272256994↵
↵
Submission for B1=> https://mirror.codeforces.com/contest/1995/submission/272164317 ↵
↵
Guys...these are the submissions for B1 and B2. I used a map to store the frequency of each no.of petals in B1, but in B2 this is already given as array C(quantity of flowers).That's the only trivial change I made . Rest of the code comprising of implementation of binary search and priority_queue remains same. ↵
↵
please help me figure out why is it getting accepted in B1 but gives wrong ans in B2 in Test case 3 whereas I don't find any difference in the logic ....↵
↵
Thank you...
↵
Submission for B1=> https://mirror.codeforces.com/contest/1995/submission/272164317 ↵
↵
Guys...these are the submissions for B1 and B2. I used a map to store the frequency of each no.of petals in B1, but in B2 this is already given as array C(quantity of flowers).That's the only trivial change I made . Rest of the code comprising of implementation of binary search and priority_queue remains same. ↵
↵
please help me figure out why is it getting accepted in B1 but gives wrong ans in B2 in Test case 3 whereas I don't find any difference in the logic ....↵
↵
Thank you...
