-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathleetcode_973.cpp
82 lines (66 loc) · 1.32 KB
/
leetcode_973.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
/*
* =========================================================================
*
* FileName: leetcode_973.cpp
*
* Description:
*
* Version: 1.0
* Created: 2019-01-14 10:30:36
* Last Modified: 2019-01-14 10:31:00
* Revision: none
* Compiler: gcc
*
* Author: zt ()
* Organization:
*
* =========================================================================
*/
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <stddef.h>
#include <string.h>
#include <signal.h>
#include <errno.h>
#include <unistd.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <sys/socket.h>
#include <iostream>
#include <memory>
#include <algorithm>
#include <vector>
#include <thread>
#include <mutex>
#include <map>
#include <list>
#include <string>
#include <functional>
using namespace std;
vector<vector<int>> kClosest ( vector<vector<int>>& points, int K )
{
vector<vector<int>> ret;
multimap<int, vector<int> > mmap;
int d = 0;
for ( auto& v : points )
{
d = 0;
d = v[0] * v[0] + v[1] * v[1];
mmap.insert ( {d, v} );
}
int i = 0;
for ( auto& e : mmap )
{
ret.push_back ( e.second );
if ( ++i == K )
break;
}
return ret;
}
int main ( int argc, char* argv[] )
{
( void ) argc;
( void ) argv;
return 0;
}