Cod sursa(job #710078)
| Utilizator | Data | 8 martie 2012 22:13:44 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<iostream>
#include<math.h>
#include<fstream>
#include<string.h>
using namespace std;
ifstream f ("elmaj.in");
ofstream g ("elmaj.out");
int x;
int bruteforceElmaj(int n, int v[100], int &x)
{
for(int i=1; i<=n; i++)
{
x = 0;
for(int j=1; j<=n; j++)
if(v[i] == v[j])
x++;
if(x > n/2)
{
return v[i];
}
}
return -1;
}
int main()
{
int n,v[100],i,x = 0,max;
cin>>n;
for(i=1; i<=n; i++)
f>>v[i];
g<<bruteforceElmaj(n, v, x);
g<<" "<<x;
return 0;
}