Cod sursa(job #2097110)
Utilizator | Data | 30 decembrie 2017 15:34:12 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Teme Pregatire ACM Unibuc 2013 | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int v[1000002];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, x, i, maxim, maxi;
f>>n;
for(i=1; i<=n; i++)
{
f>>x;
v[x]++;
if(v[x]>maxim)
{
maxim=v[x];
maxi=x;
}
}
if(maxim>n/2)
g<<maxi<<" "<<maxim;
else g<<"-1";
return 0;
}