记录编号	67608	评测结果	AAAAAAAAAA
题目名称	141.[USACO Jan08] 奶牛的选举	最终得分	100
用户昵称	TerryLam	是否通过	通过
代码语言	Pascal	运行时间	0.052 s
提交时间	2013-08-13 20:35:06	内存使用	0.74 MiB

var
  a,b,c:array[1..50000] of longint;
  n,k,i,j:longint;
procedure qsort1(l,r:longint);
  var x,y,m,t:longint;
  begin
    x:=l;
    y:=r;
    m:=a[(l+r) div 2];
    repeat
      while a[x]>m do inc(x);
      while a[y]<m do dec(y);
      if x<=y then
        begin
          t:=a[x];
          a[x]:=a[y];
          a[y]:=t;
          t:=b[x];
          b[x]:=b[y];
          b[y]:=t;
          t:=c[x];
          c[x]:=c[y];
          c[y]:=t;
          inc(x);
          dec(y);
        end;
    until x>y;
    if l<y then qsort1(l,y);
    if x<r then qsort1(x,r);
  end;
procedure qsort2(l,r:longint);
  var x,y,m,t:longint;
  begin
    x:=l;
    y:=r;
    m:=b[(l+r) div 2];
    repeat
      while b[x]>m do inc(x);
      while b[y]<m do dec(y);
      if x<=y then
        begin
          t:=b[x];
          b[x]:=b[y];
          b[y]:=t;
          t:=c[x];
          c[x]:=c[y];
          c[y]:=t;
          inc(x);
          dec(y);
        end;
    until x>y;
    if l<y then qsort2(l,y);
    if x<r then qsort2(x,r);
  end;
begin
  assign(input,'elect.in');
  reset(input);
  readln(n,k);
  for i:=1 to n do
    begin
      readln(a[i],b[i]);
      c[i]:=i;
    end;
  close(input);
  qsort1(1,n);
  qsort2(1,k);
  assign(output,'elect.out');
  rewrite(output);
  writeln(c[1]);
  close(output);
end.