Cod sursa(job #1405148)
| Utilizator | Data | 28 martie 2015 21:48:23 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.78 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream is("elmaj.in");
ofstream os("elmaj.out");
int n;
int a[100002];
int nr = -1;
int k = 0;
int main()
{
is >> n;
for(int i = 1; i <= n; ++i)
is >> a[i];
for(int i = 1; i <= n; ++i)
{
if( k == 0)
{
nr = a[i];
k = 1;
}
else if(a[i] == k)
{
k++;
}
else
k--;
}
if(nr >= 0)
{
int cnt = 0;
for(int i = 1; i<= n; ++i)
{
if(a[i] == nr)
cnt++;
}
if(cnt > n/2)
os << nr << ' ' << cnt;
}
else
os << -1;
is.close();
os.close();
return 0;
}
