Cod sursa(job #2542333)
Utilizator | Data | 9 februarie 2020 20:15:56 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long a[1000001],nr,i,j,p,n,Max;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
{
nr=0;
for(j=1;j<=n;j++)
{if(a[i]==a[j])
nr++;
}
if(nr>=n/2+1)
{
Max=a[i];
p=nr;
}
}
g<<Max<<" "<<p;
}