说明：  C++简单实现K-Means聚类算法 (2,10), (2,5), (8,4), (5,8), (7,5), (6,4), (1,2), (4,9), (7,3), (1,3), (3,9) （红色的表示初始所选的中心点） K-means算法介绍可参考其他资料或书籍。
(C++ simple implementation of K-Means clustering algorithm(2, 5), (2, 5), (8,4), (5,8), (7,5), (6,4), (1,2), (4,9) , 3), (1,3), (3,9) (red indicates the initial selected center) K-means algorithm can refer to other information or books.)