algorithmStudy/11652.cpp at master · judy5050/algorithmStudy · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>

using namespace std;

long long card[1000000];
long long res;
int m=1;
int cnt=1;
int main() {

	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int a;
	cin >> a;
	for (int i = 0;i < a;i++) {
		int index=0;
		cin >> card[i];
	}
	res = card[0];
	sort(card, card + a);

	for (int i = 1;i < a;i++) {
		if (card[i - 1] == card[i])
		{
			cnt++;

		}
		else {
			cnt = 1;
		}
		if (cnt > m) {
			m = cnt;
			res = card[i];
		}


	}


	cout << res << "\n";


	return 0;
}