Cod sursa(job #1322233)
Utilizator | Data | 19 ianuarie 2015 21:35:03 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long int v[1000009];
int main()
{
int n,a,c,i,ma1=0,ma2;
f>>n;
while (f>>a)
{
v[a]++;
}
c=n/2+1;
for (i=1;i<=1000009;i++)
{
if (ma1<v[i])
{
ma1=v[i];
ma2=i;
}
}
if (ma1>=c) g<<ma2<<" "<<ma1;
else g<<"-1";
return 0;
}