Cod sursa(job #997935)
| Utilizator | Data | 15 septembrie 2013 11:31:47 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n, i, v[1000001], k, maxi, j;
int main()
{
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=n;i++)
{
k==0;
for(j=1;j<=n;j++)
{
if(v[i]==v[j])k++;
}
if(k>n/2)
{
g<<v[i]<<" "<<k;
break;
}
}
if(k<n/2+1)g<<-1;
f.close();
g.close();
return 0;
}
