正在加载……
← 返回 salesforce 的题目列表
Top K Points
类型：online_judge
Given a set of points on a plane, find the K points closest to the origin. The time complexity should be O(n log k).