Could anyone give a solution to the problem below with $$$O(n\log n)$$$ or $$$O(n\log^2n)$$$ time plz?

Given two sequences $$$g,h$$$ with length $$$n$$$ and a binary function $$$F(n,k)$$$, calculate the sequence $$$f$$$ which satisfies:

And $$$F(n,k)$$$ can be arbitrary, such as $$$1$$$, $$$\binom{n}{k}$$$, $$$n^k$$$ or $$$k^n$$$.

Could anyone tell me why users like dzh_loves_mjy are not rated even their ratings are under 2099?

Thanks lol