Cod sursa(job #660420)
Utilizator | Data | 12 ianuarie 2012 23:15:18 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,cand=-1,i,k=0,a[1000001];
int main(){
f>>n;
for(i=1;i<=n;i++){
f>>a[i];
if(k==0) cand=a[i];
if(cand==a[i])
k++;
else
k--;
}
k=0;
for(i=1;i<=n;i++)
if(a[i]==cand) k++;
if(k > n/2)
g<<cand<<' '<<k;
else
g<<-1;
f.close(); g.close();
return 0;
}