Cod sursa(job #716957)
| Utilizator | Data | 19 martie 2012 14:07:52 | |
|---|---|---|---|
| Problema | Elementul majoritar | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
int n;
vector<int> v;
int main()
{
int i,x,m,nr=1;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1;i<=n;i++)
{
f>>x;
v.push_back(x);
}
sort(v.begin(),v.end());
m=v[(n-1)/2];
for(i=(n-1)/2-1;i>=0&&v[i]==m;i--)
nr++;
for(i=(n-1)/2+1;i<=n&&v[i]==m;i++)
nr++;
if(nr>=(n/2+1))
g<<m<<' '<<nr;
else
g<<"-1";
return 0;
}
