Finding Experts

A user with rating $C$ and solved-problem count $D$ is recognized by everyone precisely when $C \ge A_i$ and $D \ge B_i$ hold for every $i$.

Let $M_A = \max_{1 \le i \le N} A_i$ and . The conditions are equivalent to and .

For each test case, compute both maxima and count users satisfying $C_i \ge M_A$ and $D_i \ge M_B$.

The time complexity is $O(N)$ per test case and $O(\sum N)$ overall. The space complexity is $O(N)$. Solution written by GPT6