Cod sursa(job #1788083)
Utilizator | Data | 25 octombrie 2016 17:24:33 | |
---|---|---|---|
Problema | Elementul majoritar | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int main()
{
int n,poz=0,x;
f>>n;
vector<int> a(n);
for(int i=0;i<n;++i)
{
f>>a[i];
}
sort(a.begin(),a.end());
x=a[0];
for(int i=1; i<n; ++i)
{
if(a[i]!=x)
{
if(i-poz>=n/2-1)
{
g<<x<<" "<<i-poz;
return 0;
}
else
{
poz=i;
x=a[i];
}
}
}
return 0;
}