Mai intai trebuie sa te autentifici.
Cod sursa(job #653209)
| Utilizator | Data | 27 decembrie 2011 16:32:57 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#define maxn 1000001
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n,maj,nrpoz,v[maxn];
int bruteForceMajority(int n, int a[], int &nr)
{for (int i = 0; i < n; i++)
{nr = 0;
for(int j = 0; j < n; j++) if (a[j]==a[i]) nr++;
if(nr > n / 2) return a[i];
}
return -1;
}
int main(void)
{ f>>n;
for(int i=0;i<n;i++) f>>v[i];
maj=bruteForceMajority(n,v,nrpoz);
if(maj==-1) g<<"-1\n";
else g<<maj<<' '<<nrpoz<<'\n';
g.close(); return 0;
}
