Pagini recente » Cod sursa (job #2342396) | Cod sursa (job #2732601) | Cod sursa (job #2611393) | Cod sursa (job #2180578) | Cod sursa (job #710497)
Cod sursa(job #710497)
#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
long j,s,v[1000000],nr=1,i,k;
int n;
int main ()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
sort(v+1,v+n+1);
for(i=2;i<=n;i++)
if(v[i]==v[i-1])
{nr++;
if(nr>=n/2+1)
{s=v[i];j=nr;}}
else nr=1;
g<<s<<" "<<j;
g.close();
}