백준 2108 [c++]

#include <iostream> #include <algorithm> #include <cmath> using namespace std; int temp = -1, temp1, index = 0 ; int ct = 1, ct2 = 0; int arr[500001]; double first = 0; bool reset = true; int main(void) { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> arr[i]; first = double(arr[i]) + first; } temp1 = n; sort(&arr[0], &arr[0] + n); for (int j = 0; j < temp1 - 1; j++) { while (arr[index] == arr[index + 1]) { index++; ct++; temp1 = temp1 - 1; } if (ct > temp) { temp = ct; ct2 = index; reset ...

원문링크 : 백준 2108 [c++]