| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
Find k-th fraction
n<=1e5, q<=n^2, k<=n^2, qn<=1e5
a and b are integer arrays of length n. q queries are asked and you need to find k-th largest fraction among ai/bj (0<=i,j<n). You can do it offline.
(Note: binary searching on a/b as a float/double/long double does not work due to precision. I could not find any judge to submit the solution sorry.)
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
coolboy19521 | 2025-07-02 19:12:48 | 2 | Tiny change: ',bi<=1e6\nEdit: Ap' -> ',bi<=1e6\n\nEdit: Ap' | |
| en6 |
|
coolboy19521 | 2025-07-02 19:12:34 | 97 | ||
| en5 |
|
coolboy19521 | 2025-07-02 11:15:01 | 2 | Tiny change: 'h query.\nEdit: ai' -> 'h query.\n\nEdit: ai' | |
| en4 |
|
coolboy19521 | 2025-07-02 11:14:43 | 18 | Tiny change: 'ach query.' -> 'ach query.\nEdit: ai,bi<=1e6' | |
| en3 |
|
coolboy19521 | 2025-07-01 23:25:18 | 2 | Tiny change: 'ching on a/b as a floa' -> 'ching on ai/bj as a floa' | |
| en2 |
|
coolboy19521 | 2025-07-01 23:21:09 | 90 | ||
| en1 |
|
coolboy19521 | 2025-07-01 23:18:25 | 356 | Initial revision (published) |
