这道题我做过的，下面就演示给大家看：program yao;
type
caiyo = record
time:1..100;
jage:1..100;
end;
arr = array [1..100] of caiyo;
var
a:arr;
m,i,j,b,t:integer;
g,f:text;
q:caiyo;
begin
assign(g,'medic.txt');
assign(f,'medic.out');
reset(g);
rewrite(f);
readln(g,t,m);
for i := 1 to m do
readln(g,a.time,a.jage);
for i := 1 to m-1 do
for j := 1 to m-i do
if a[j].jage / a[j].time < a[j+1].jage / a[j+1].time then
begin
q:=a[j];
a[j]:=a[j+1];
a[j+1]:=q;
end;
for i := 1 to m do
if t >= a.time then
begin
t := t - a.time;
b := b + a.jage;
end;
write(f,b);
close(g);
close(f);
end.
我用的是记录类型做的不只道符不符合大侠的口味.
