Решение задачи Minmax 19

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, minim = 10000000, k = 0;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i];
    }
    for(int i = 0; i < n; ++i){
        if(minim > a[i]){
            minim = a[i];
        }
    }
    for(int i = 0; i < n; ++i){
        if(a[i] == minim)
            ++k;
    }
    cout << k ;
    return 0;
}

import random

N = random.randrange(1,15)
print("N = ",N)

L1 = [random.randint(1, 7) for i in range(N)]
print("Initial:")
print(L1)

m = min(L1)
print("Minimum:",m)
L2 = [i for i in L1 if i == m]
print("Processed:")
print(L2)
print("Amount of minimums:",len(L2))
									

program MinMax19;
var
 
  N,Ni,Min,i,RezNum:Integer;
 
begin
  Write('N:');
  Readln(N);
  for i:=1 to N do
   begin
     Write(i,' элемент:');
     Readln(Ni);
 
     if i=1 then
      begin
       Min:=Ni;
       RezNum:=0;
      end;
 
 
     if Ni<Min then
      begin
       Min:=Ni;
       RezNum:=0;
      end;
 
     if Ni=Min then inc(RezNum);
 
   end;
   Writeln(RezNum);
end.