Pagini recente » Cod sursa (job #1873647) | Cod sursa (job #677975) | Cod sursa (job #879229) | Cod sursa (job #1543998) | Cod sursa (job #1602932)
#include <bits/stdc++.h>
using namespace std;
ifstream in("elmaj.in");
ofstream out("elmaj.out");
long long int v[1000000],n,val[1000000],num[1000000],q,t;
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
if(v[i] == v[j] && v[i]!=0){
num[v[i]]=v[i];
val[v[i]]++;
v[j]=0;
}
v[i]=0;
}
int sortat=0;
do{
sortat=1;
for(int i=1;i<n;i++)
if(val[i]<val[i+1]){
t=val[i],val[i]=val[i+1],val[i+1]=t;
q=num[i],num[i]=num[i+1],num[i+1]=q;
sortat=0;
}
}
while(sortat == 0);
out<<num[1]<<" "<<val[1];
return 0;
}