数据挖掘-k平均算法

/*
题目内容：实现k平均算法的代码，并且通过样例
代码：
*/
#include <bits/stdc++.h>
using namespace std;
#define eps 1e-8
#define INF 0x3f3f3f3f
const int N = 1e6 + 10;
int n, k;
pair<double, double> a[N], b[N];
vector<pair<double, double> > v[N];
double dist(double x1 ,double y1, double x2, double y2) {
	return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
int main() {
	double x, y;
	scanf("%d %d", &n, &k);
	for(int i = 0; i < n; i++) {
		scanf("%lf %lf", &x, &y);
		a[i] = make_pair(x, y);
		v[i % k].push_back(a[i]);
	} 
	double ans = 0, pre = 0;
	double cntx, cnty, tmp, tmpdis;
	int id;
	for(int i = 0; i < k; i++) {
		cntx = 0;
		cnty = 0;
		for(int j = 0; j < v[i].size(); j++)
			cntx += v[i][j].first, cnty += v[i][j].second;
		b[i] = make_pair(cntx / v[i].size(), cnty / v[i].size());
		for(int j = 0; j < v[i].size(); j++)
			ans += dist(v[i][j].first, v[i][j].second, b[i].first, b[i].second); 
	}
	
	while(fabs(pre - ans) > eps) {
		pre = ans;
		ans = 0;
		for(int i = 0; i < k; i++) v[i].clear();
		for(int i = 0; i < n; i++) {
			tmp = INF;
			for(int j = 0; j < k; j++) {
				tmpdis = dist(a[i].first, a[i].second, b[j].first, b[j].second);
				if(tmp > tmpdis) {
					tmp = tmpdis;
					id = j;
				}
			}
					
			v[id].push_back(a[i]);
		}
		for(int i = 0; i < k; i++) {
			cntx = 0;
			cnty = 0;
			for(int j = 0; j < v[i].size(); j++)
				cntx += v[i][j].first, cnty += v[i][j].second;
			b[i] = make_pair(cntx / v[i].size(), cnty / v[i].size());
			for(int j = 0; j < v[i].size(); j++)
				ans += dist(v[i][j].first, v[i][j].second, b[i].first, b[i].second); 
		}
	}
	for(int i = 0; i < k; i++) {
		printf("%d:\n", i);
		for(int j = 0; j < v[i].size(); j++)
			printf("%.2f %.2f\n", v[i][j].first, v[i][j].second);
	}
	return 0;
}