Cod sursa(job #1292797)
| Utilizator | Data | 14 decembrie 2014 19:43:16 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,vmax,imax,a[1001000],nr;
int main()
{
fin >> n;
for(i = 1; i <= n; i ++)
fin >> a[i];
sort(a + 1, a + n + 1);
nr = 1;
for(i = 1; i < n; i ++)
if(a[i] == a[i + 1])
{
nr ++;
if(nr > imax)
{
imax = nr;
vmax = a[i];
}
}
else
nr = 1;
fout << vmax << " " << imax;
return 0;
}
