Программа рассчитана на то, что на экран выводится самый последний массив с результатами.uses crt; constp=5; r=5; s=5; var a: array[1… p] of integer; b: array[1… r] of integer; c: array[1… s] of integer; m: array[1… 3] of integer; k,l,i,g,j,d,v,n: integer; beginreadln (l); writeln; for i: =1 to p doreadln (a[i]); writeln; for j: =1 to r doreadln (b[j]); writeln; for g: =1 to s doreadln (c[g]); writeln; for i: =1 to p-1 dorepeatd: =0; if a[i]>a[i+1] thenbegind: =1; a[i]: =a[i]+a[i+1]; a[i+1]: =a[i]-a[i+1]; a[i]: =a[i]-a[i+1]; end; until d=0; for j: =1 to r-1 dorepeatd: =0; if b[j]>b[j+1] thenbegind: =1; b[j]: =b[j]+b[j+1]; b[j+1]: =b[j]-b[j+1]; b[j]: =b[j]-b[j+1]; end; until d=0; for g: =1 to s-1 dorepeatd: =0; if c[g]>c[g+1] thenbegind: =1; c[g]: =c[g]+c[g+1]; c[g+1]: =c[g]-c[g+1]; c[g]: =c[g]-c[g+1]; end; until d=0; for i: =1 to p doif a[i]=l then inc (v); m[1]: =v; v: =0; for j: =1 to r doif b[j]=l then inc (v); m[2]: =v; v: =0; for g: =1 to s doif c[g]=l then inc (v); m[3]: =v; for n: =1 to 2 dorepeatd: =0; if m[n]>m[n+1] thenbegind: =1; m[n]: =m[n]+m[n+1]; m[n+1]: =m[n]-m[n+1]; m[n]: =m[n]-m[n+1]; end; until d=0; for n: =1 to 3 dowriteln (m[n]); end.
