Pagini recente » Cod sursa (job #214871) | Cod sursa (job #1378619) | Cod sursa (job #1179857) | Cod sursa (job #2127340) | Cod sursa (job #1130660)
#include <fstream>
using namespace std;
int v[2000000];
int main()
{
ifstream f("elmaj.in");
ofstream g("elmaj.out");
int n , i , contor = 1, b = -1 , j;
f >> n ;
for(i = 1; i <= n ; i++)
f >> v[i];
for(i = 1; i <= n ; i++)
{
if(v[i] != -1)
{
for(j = i + 1 ; j <= n ; j++)
{
if(v[i] == v[j])
{
contor++;
v[j] = -1 ;
}
}
if(contor >= (n / 2 + 1))
{
g << v[i] << " " << contor << "\n";
b = 0 ;
contor = 1;
}
else
contor = 1;
}
}
if(b == -1)
g << b ;
}