poj1160post office{动态规划…

var

  v,p,i,j,pos:longint;

  x:array[1..300] of longint;

  w:array[1..300,1..300] of longint;

  f:array[1..300,0..30] of longint;

procedure swap(var a,b:longint);

var

  t:longint;

begin

  t:=a;a:=b;b:=t;

end;

procedure qsort(l,r:longint);

var

  i,j,m:longint;

begin

  i:=l;

  j:=r;

  m:=x[(l+r) shr 1];

  repeat

    while x[i]

    while x[j]>m do dec(j);

    if i<=j then

      begin

        swap(x[i],x[j]);

        inc(i);

        dec(j);

      end;

  until i>j;

  if j>l then qsort(l,j);

  if i

end;

function cost(l,r:longint):longint;

var

  x0,i:longint;

begin

  cost:=0;

  x0:=x[(l+r) div 2];

  for i:=l to r do

    inc(cost,abs(x[i]-x0));

end;

function min(a,b:longint):longint;

begin

  if a

  else exit(b);

end;

begin

  read(v,p);

  for i:=1 to v do read(x[i]);

  qsort(1,v);

  for i:=1 to v-1 do

    for j:=i+1 to v do

      w[i,j]:=cost(i,j);

  fillchar(f,sizeof(f),70);

  for i:=1 to v do

    f[i,1]:=w[1,i];

  for j:=2 to p do

    for i:=j to v do

      for pos:=j to i do

        f[i,j]:=min(f[pos,j-1]+w[ pos+1,i],f[i,j]);{注意此处不是pos+1，因为f[i,j]表示把前i个村庄已经连接起来了}

  writeln(f[v,p]);

end.