（用pascal语言）.

楼上的不要不懂装懂,明显是个树状数组的题目
原题：ural1028 （直接在百度里面搜索）
我的代码：（交URAL以后AC的代码）
type point=record
x,y:longint;
end;
var a,b,d,e,f:longint;
star:array[1..15001]of point;
n,max:longint;
c,level:array[0..15001]of longint;
t:array[0..32002]of longint;
procedure init;
begin
max:=0;
n:=0;
readln(n);
fillchar(c,sizeof(c),0);
fillchar(level,sizeof(level),0);
fillchar(t,sizeof(t),0);
for a:=1 to n do begin
readln(star[a].x,star[a].y);
if star[a].x>max then max:=star[a].x;
end;
close(input);
end;
function lowbit(x:longint):longint;
begin
exit(x and (-x));
end;
function sum(x:longint):longint;
var r:longint;
begin
r:=0;
while x>0 do begin
r:=r+t[x];
x:=x-lowbit(x);
end;
exit(r);
end;
procedure insert(x:longint);
begin
while x