Cod sursa(job #1184471)
Utilizator | Data | 12 mai 2014 20:10:20 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int main()
{ifstream g("elmaj.in");
ofstream f("elmaj.out");
int n,x,y[1000000];
long long v[1000000],h=0;
g>>n;
for(int i=1;i<=n;i++)
y[i]=0;
for(int i=1;i<=n;i++)
{g>>v[i];
h=v[i];
y[h]=y[h]+1;
}
for(int i=1;i<=n;i++)
{if(y[i]>h)
{h=y[i];
x=v[i];
}
}
if(h==0&&h>n/2+1)
f<<"-1";
else
f<<x<<" "<<h;
return 0;
}