Cod sursa(job #1328264)
Utilizator | Data | 28 ianuarie 2015 10:09:18 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,a[1000001],Maj,Max,poz,i,p[1000001];
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
f>>n;
Max=Maj=0;
for (i=1; i<=n; i++)
{
f>>a[i];
if (a[i]>Max) Max=a[i];
}
for (i=1; i<=n; i++)
{
p[a[i]]++;
}
for (i=0; i<=Max+1; i++)
{
if (p[i]!=0)
if (p[i]>Maj)
{
Maj=p[i];
poz=i;
}
}
g<<poz<<' '<<Maj;
return 0;
}