Cod sursa(job #2295787)
Utilizator | Data | 3 decembrie 2018 22:32:32 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("elmaj.in");
ofstream cout("elmaj.out");
int a[1000000], n, k, maj;
int main() {
cin>>n;
for(int i=0; i<n; i++) {
cin>>a[i];
if(k==0)
k=1, maj=a[i];
else
if(a[i]==maj)
k++;
else
k--;
}
k=0;
for(int i=0; i<n; i++)
if(a[i]==maj)
k++;
if(k>n/2) {
cout<<maj<<' '<<k;
}
else
cout<<-1;
return 0;
}