Cod sursa(job #1377083)
| Utilizator | Data | 5 martie 2015 20:01:47 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj,in");
ofstream g ("elmaj.out");
int n,i,fr[10000],v[10000],maxx,minn=999999,aux;
int main()
{
f >> n;
for (i=1;i<=n;i++)
f >> v[i];
for (i=1;i<=n;i++)
{
aux=v[i];
fr[aux]++;
}
for (i=1;i<=n;i++)
{if (v[i]>=maxx)
maxx=v[i];
if (v[i]<minn)
minn=v[i];}
for (i=minn;i<=maxx;i++)
if (fr[i]>=(n/2)+1)
{
g << i << " " << fr[i];break;}
return 0;
}
