Cod sursa(job #640005)
| Utilizator | Data | 24 noiembrie 2011 15:47:49 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
long long n, a[1000009], i, x, k, nr;
int main()
{
f>>n;
for(i=1; i<=n; ++i)
{
f>>a[i];
if(k==0) { x=a[i];
k=1;
}
else if(a[i]==x) ++k;
else --k;
}
for(i=1; i<=n; ++i) if(a[i]==x) ++nr;
if(nr>n/2) g<<x<<" "<<nr<<"\n";
else g<<-1<<"\n";
f.close();
g.close();
return 0;
}
