Cod sursa(job #1692178)
| Utilizator | Data | 20 aprilie 2016 12:49:38 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int n,i,wn,k,t;
f>> n;
long A[n];k=0;wn=0;
for(i=0;i<n;i++)
f>>A[i];
for(i=0;i<n;i++)
{
if(k==0)wn=A[i];
else if(A[i]==wn)k++;
else k--;
}
t=0;
for(i=0;i<n;i++)
if(A[i]==wn)t++;
if(t>n/2)g<< wn <<" "<< t;
else g<< -1;
f.close();
g.close();
return 0;
}
