| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
Google面试题,求kth largest elementyou are given 2 arrays sorted in decreasing order of size m and n respectively. Input: a number k <= n*m and >= 1 Output: the kth largest sum( a+b ) possible. where a (any element from array 1) b (any element from array 2) 两个数组A,B 求第k个sum( a+b )。 给出高效解法! Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator