program otchet;
uses crt;
type
 Base=Record
  n:string;
  v:real;
  f:real;
  k:real;
 end;
var
 Predp:array [1..100] of Base;
 Pr:Base;
 i,im,j,m:integer;
 km,sum:real;
begin
 clrscr;
 write('Vvedite kolichestvo predpriyatiy= ');
 readln(m);
 for i:=1 to m do
  with Predp[i] do
   begin
    write('Vvedite nazvanie predpriyatiya ',i,' = ');
    readln(n);
    repeat
     write('vvedite planoviy obiom roznichnogo tovarooborota= ');
     readln(v);
     if v=0 then writeln('Plan ne mojet byt nulevym!!!');
    until v>0;
    write('Vvedite fakticheskiy obiom roznichnogo tovarooborota= ');
    readln(f);
   end;
 km:=-999;
 for i:=1 to m do
  with Predp[i] do
   begin
    k:=f/v*100;
    if k>km then
     begin
      km:=k;
      im:=i;
     end;
   end;
 writeln;
 writeln('naimen. predpr, plan, fact, proc:');
 for i:=1 to m do
  with Predp[i] do
   begin
    write(n);
    for j:=Length(n)+1 to 40 do write(' ');
    writeln(v:10:2,f:10:2,k:10:2);
   end;
 writeln;
 writeln('naib proc = ',km:10:2,' u predpr ',Predp[im].n);
 readln;
 for i:=1 to m do
  If Predp[i].f<=Predp[i].v then sum:=sum+Predp[i].f;
 Write('Summa obioma tovarooborota predpriatii, nedovipolnivshih plan = ',sum:8:2);
 readln;

 writeln;
 for j:=1 to m-1 do
  for i:=1 to m-j do
   if Predp[i].k<Predp[i+1].k then
    begin
     Pr:=Predp[i];
     Predp[i]:=Predp[i+1];
     Predp[i+1]:=Pr;
    end;
 writeln;
 writeln('sort po proc ');
 for i:=1 to m do
  with Predp[i] do
  begin
   write(n);
   for j:=Length(n)+1 to 40 do write(' ');
   writeln(k:6:2);
  end;
 readln;
end.