Pagini recente » Cod sursa (job #1944923) | Cod sursa (job #3278250) | Cod sursa (job #628277) | Cod sursa (job #2092488) | Cod sursa (job #2788026)
/// complexitate O(n*n)
#include <fstream>
using namespace std;
ifstream f("elmaj.in"); ofstream g("elmaj.out");
int v[1000001];
int main()
{ int n;
f>>n;
for(int i=1;i<=n;++i) f>>v[i];
for(int i=1;i<=n;i++)
{ int nr=0;
for(int j=1;j<=n;j++)
if(v[i]==v[j]) nr++;
if(nr>n/2) {g<<v[i]<<' '<<nr; g.close(); f.close(); return 0;}
}
g<<"-1"; g.close(); f.close(); return 0;
}