Cod sursa(job #1322709)
Utilizator | Data | 20 ianuarie 2015 12:13:31 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
int v[1000005],c=-1,k=0,n,i,p;
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for (i=1;i<=n;i++)
{
f>>v[i];
if (k==0) {c=v[i];k=1;}
if (k!=0 && c==v[i])
k++;
if (k!=0 && c!=v[i])
k--;
}
for (i=1;i<=n;i++)
{
if (v[i]==c) p++;
}
if (p>=n/2+1) g<<c<<" "<<p;
else g<<-1;
return 0;
}