Pagini recente » Cod sursa (job #1700832) | Cod sursa (job #2296077) | Diferente pentru happy-coding-2006/solutii intre reviziile 26 si 1 | Cod sursa (job #544424) | Cod sursa (job #1228110)
#include<fstream>
using namespace std;
ifstream f("elmaj.in",ios::in);
ofstream g("elmaj.out",ios::out);
int main()
{
int n,a[1000001],i,v[10000001],j;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
v[i]=1;
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(a[i]==a[j])
v[i]++;
for(i=1;i<=n;i++)
if(v[i]>=(n/2+1))
g<<a[i]<<' '<<v[i];
g<<'\n';
return 0;}