Cod sursa(job #709927)
Utilizator | Nicu B. NicuCJ | Data | 8 martie 2012 18:26:49 |
---|---|---|---|
Problema | Elementul majoritar | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[1000001];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, j, i, contor=1, contor2=0;
f>>n;
for(i=1; i<=n; i++)
{
f>>v[i];
}
sort(v+1, v+n+1);
for(i=1; i<=n; i++)
{
if(v[i]==v[i+1])
contor++;
else
contor=1;
if(contor>n/2)
g<<v[i]<<" "<<contor;
else
contor2++;
}
if(contor2==n)
g<<-1;
}