Cod sursa(job #1341661)
| Utilizator | Data | 12 februarie 2015 23:14:35 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int v[100000];
int main()
{
int n,i,cont,maxx,maxc,j;
f>>n;maxx=0;maxc=0;
for (i=0;i<n;++i)
{
f>>v[i];cont=0;
for (j=0;j<n;++j)
{
if (v[i]==v[j])
++cont;
}
if (cont>=maxx)
{maxx=cont;
maxc=v[i];}
}
if (maxx>n/2)
g<<maxc<<" "<<maxx;
else
g<<"-1";
return 0;
}
