Cod sursa(job #1379748)
| Utilizator | Data | 6 martie 2015 19:16:21 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int a[1000001], i, n, cand=-1, ap, k;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>a[i];
if(k==0)
{
cand=a[i];
k++;
}
else if(cand==a[i]) k++;
else k--;
}
if(cand<0) g<<-1;
else
{
for(i=1;i<=n;i++)
if(a[i]==cand) ap++;
if(ap>n/2) g<<cand<<' '<<ap;
else g<<-1;
}
return 0;
}
