题目链接题目描述输入n个整数，输出出现次数大于等于数组长度一半的数。#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1e6+5;
int num[maxn];
int main()
{
int n,i=0;
while(cin>>n)
...
题目链接：https://vjudge.net/problem/51Nod-1284思路：#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
long long n;
long long a,b,c,d;
// 2 3 5 7
...