Pagini recente » Cod sursa (job #1917692) | Cod sursa (job #1397889) | Cod sursa (job #2791263) | Cod sursa (job #183448) | Cod sursa (job #2982087)
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
int main()
{
unsigned int n,i,p,m;
in>>n;
m=n;
unsigned int v[n+1],v1[n+1];
for(i=1; i<=n; i++)
{
in>>v[i];
v1[i]=v[i];
}
/*
unsigned int a[n+1]= {0},nr=0;
for(i=1; i<=n; i++)
{
a[v[i]]++;
if(a[v[i]]==1)
nr++;
}
for(i=1; i<=nr; i++)
if(a[v[i]]>=(n/2)+1)
out<<v[i]<<' '<<a[v[i]];*/
for(i=1; i<=m; i++)
{
if(v1[i]!=v1[i+1])
{
for(p=i+1; p<=m-1; p++)
v1[p]=v1[p+1];
for(p=i; p<=m-1; p++)
v1[p]=v1[p+1];
m-=2;
i--;
}
}
unsigned int x=v1[m],nr=0;
out<<x<<' ';
for(i=1; i<=n; i++)
{
if(v[i]==x)
nr++;
}
out<<nr;
in.close();
out.close();
return 0;
}