Var n,i,j,c: integer; mas: array[1..999] of integer; begin readln(n); for i: =1 to 2*n do readln(mas[i]); //группируем массив в порядке возрастания for i : = 1 to 2*n-1 do for j : = 1 to 2*n-i do if mas[j] > mas[j+1] then begin c : = mas[j]; mas[j] : = mas[j+1]; mas[j+1] : = c; end; writeln('оптимальные пары: '); for i: =1 to 2*n do begin if i mod 2 = 1 then write(mas[i],' и '); if i mod 2 = 0 then writeln(mas[i]); end; end.
kosbart28
05.02.2020
Var a: array [1..1000] of integer; i, n, min, amount: integer; begin read(n); {сначала считываем кол-во элементов} for i : = 1 to n do read(a[i]); min : = 10000; amount : = 0; for i : =1 to n do if (a[i] < min) and (a[i] > = 0) then min : = a[i]; for i : = 1 to n do if a[i] = min then amount : = amount + 1; writeln('min: ', min, ', amount: ', amount); end.
70%