# 题目

## Description

We have $$N$$ ($$N≤10000$$) objects, and wish to classify them into several groups by judgement of their resemblance. To simply the model, each object has $$2$$ indexes $$a$$ and $$b$$ ($$a,b≤500$$). The resemblance of object $$i$$ and object $$j$$ is defined by $$d_{i,j}=|a_i-a_j|+|b_i-b_j|$$, and then we say $$i$$ is $$d_{i,j}$$resemble to $$j$$. Now we want to find the minimum value of $$X$$, so that we can classify the $$N$$ objects into $$K$$ ($$K < N$$) groups, and in each group, one object is at most $$X$$ resemble to another object in the same group, i.e, for every object $$i$$, if $$i$$ is not the only member of the group, then there exists one object $$j$$ ($$i ≠ j$$) in the same group that satisfies $$d_{i,j} ≤ X$$ # Input The first line contains two integers $$N$$ and $$K$$. The following $$N$$ lines each contain two integers $$a$$ and $$b$$, which describe a object. # Output A single line containsthe minimum $$X$$. # 题目分析 简述题意：

2017-01-01