Pagini recente » Cod sursa (job #2839938) | Cod sursa (job #3001614) | Istoria paginii runda/hlo_10_vacanta | Cod sursa (job #3262225) | Cod sursa (job #2431130)
#include <fstream>
using namespace std;
ifstream in ("elmaj.in");
ofstream out ("elmaj.out");
int main()
{
long long n, v[100000], i, maj=0, ap, k, x;
in>>n;
for (i=1; i<=n; i++)
{
in>>v[i];
}
for (i=1; i<=n/2; i++)
{
ap=1;
k=i;
while (k<n)
{
k++;
if (v[k]==v[i])
ap++;
}
if (ap>n/2)
{
maj=1;
x=v[i];
break;
}
}
if (maj==1)
out<<x<<" "<<ap;
else out<<"-1";
return 0;
}