Pagini recente » Cod sursa (job #2967386) | Cod sursa (job #2340426) | Cod sursa (job #783372) | Cod sursa (job #3126804) | Cod sursa (job #1263221)
#include <iostream>
#include <fstream>
using namespace std;
int n, i, aux, sw=1, maxi, maxn, max2;
long int v[1000000];
ifstream f("date.txt");
void citeste()
{
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
}
void sorteaza()
{
while(sw==1)
{
sw=0;
for(i=1;i<n;i++)
{
if(v[i]>v[i+1])
{
sw=1;
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
}
}
}
}
void rezolva()
{
maxi=1;
max2=1;
maxn=v[1];
for(i=2;i<=n;i++)
{
if(v[i-1]==v[i]){max2++;}
else {if(max2>maxi){maxi=max2;maxn=v[i-1]; max2=1;}}
}
}
int main()
{
citeste();
ifstream f("elmaj.in");
ofstream g("elmaj.out");
sorteaza();
rezolva();
g<<maxn<<' '<<maxi;
return 0;
}