Help in BOPERISH

[schrodinger]

spoj.pl/problems/BOPERISH/
what should be output of test cases like that
6
9 9 9 9 9 9
5
7 6 9 7 8

anyone having idea for that???

[leppyr64]

6
9 9 9 9 9 9
5
7 6 9 7 8
0

6
5

A scientist has index h if h of his Np papers have at least h citations each, and the other (Np − h) papers have at most h citations each.

[schrodinger]

thanks....
actually I was missing the meaning behind the quote..

[kapil_bajaj_sof]

Hi,

   Is there some special case we have to take care about? My approach is simple, I sort the numbers in non-increasing order run a loop till a[i]>=i+1, last i+1 is the answer. Please let me know if I am missing something.

Thanks
Kapil

AC

[spalac24]

Why the "i+1"? or the lines 30-33?

[kapil_bajaj_sof]

Thanks for the reply. Since my index is 0 based I have to use i+1. So a[i] should have atleast i+1 papers published.

[spalac24]

I could not find a test case where it fails, but i can say my code is pretty much like except for some details which i think are the diference, why dont you try breaking the cycle when maxi is modified? i think that maxi could be modifyed again, and that could give you WA, but i'm not totally sure.

[kapil_bajaj_sof]

Ok, after a few more submissions and hit and trial method, found the error. It was in my comparator function. It should have been a>b instead of a>=b. KMN