program p1103;
var a:array[0..10000] of boolean;
l,m:integer;
i,c,b,sum:integer;
begin
readln(l,m);
fillchar(a,sizeof(a),true);
for i:=1 to m do begin
readln(c,b);
for c:=c to b do a[c]:=false;
end;
sum:=0;
for i:=0 to l do if a then inc(sum);
writeln(sum);
end.
堆排序?
program heap;
var a:array[1..10000] of integer;
n,i:integer;
procedure down(i:integer);
var x,j:integer;
begin
x:=a;
j:=i*2;
while j<=n do
begin
if a[j]>a[j+1] then j:=j+1;
if a[j]<x then
begin
a:=a[j];
i:=j;
j:=i*2;
end else break;
end;
a:=x;
end;
procedure delete(i);
begin
n:=n-1;
if (n=0)or(i=n+1) then exit
else
begin
a:=a[n+1];
down(i);
end;
end;
{====main=====}
begin
readln(n);
for i:=1 to n do read(a);
for i:=n div 2 downto 1 do down(i);
for i:=1 to n do
begin
write(a[1]);
delete(1);
end;
end.
您想上万人在线吗? 您想日发贴上万吗?您想再现火爆的大型网站论坛效果吗?站长和管理员的必备工具三人行采集!http://www.srxzz.com |