Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- <h2>Description</h2>
- <p>给定两组数A=(a1,a2,a3,……,an)和B=(b1,b2,b3,……,bm)。将这两组数两两相乘ai*bj,得到一组数C,C共包含n*m个数。对C按照非递减的顺序排序,并找到第k大的值。</p>
- <h2>Input Format</h2>
- <p>输入包含多组测试数据。</p>
- <p>每组测试数据的第一行有三个整数:n(1<=n<=10000),m(1<=m<=10000),k(1<=k<=m*n)。</p>
- <p>第二行包含n个整数,用来表示A。</p>
- <p>第三行包含m个整数,用来表示B。</p>
- <h2>Output Format</h2>
- <p>每组测试数据的结果占一行</p>
- # Samples
- ```input1
- 1 3 3
- 1
- 3 2 1
- 3 3 7
- 1 2 3
- 1 2 3
- ```
- ```output1
- 3
- 6
- ```
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement