求noip2007普及组复赛试题及答案

第一题
program scholar(input,output);
var a,b,c,id,s:array[1..300]of integer;v:array[0..0]of boolean;
i,j,k,t,m,n,x,y:integer;
begin
assign(input,'scholar.in');
assign(output,'scholar.out');
reset(input);rewrite(output);
readln(n);
for i:=1 to n do
begin readln(a[i],b[i],c[i]);id[i]:=i;end;
for i:=1 to n do
s[i]:=a[i]+b[i]+c[i];
for i:=1 to n-1 do
for j:=i to n do
begin
if s[i]<s[j]then
begin
t:=s[i];s[i]:=s[j];s[j]:=t;
t:=a[i];a[i]:=a[j];a[j]:=t;
t:=b[i];b[i]:=b[j];b[j]:=t;
t:=c[i];c[i]:=c[j];c[j]:=t;
t:=id[i];id[i]:=id[j];id[j]:=t;
end;
if s[i]=s[j]then
if a[i]<a[j] then
begin
t:=s[i];s[i]:=s[j];s[j]:=t;
t:=a[i];a[i]:=a[j];a[j]:=t;
t:=b[i];b[i]:=b[j];b[j]:=t;
t:=c[i];c[i]:=c[j];c[j]:=t;
t:=id[i];id[i]:=id[j];id[j]:=t;
end
end;
fo