Cod sursa(job #1093892)
| Utilizator | Data | 28 ianuarie 2014 18:53:43 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include<fstream>
using namespace std;
ifstream fin("elmaj.in");
ofstream fout("elmaj.out");
int n,i,a[3000005],cand,k,nr;
int main()
{
fin >> n;
cand=-1;
for (i=1; i<=n; i++)
{
fin >> a[i];
if (k==0)
{
cand=a[i];
k=1;
}
else
{
if (a[i]==cand)
k++;
else
k--;
}
}
for (i=1; i<=n; i++)
{
if (a[i]==cand)
nr++;
}
if (nr>=(n / 2)+1)
fout << cand << " " << nr;
else
fout << -1;
fin.close();
fout.close();
return 0;
}
