Submission

x---------

Score: 0

User: Dormon

Problemset: F.Ueka Battle

Language: cpp

Time: 0.847 second

Submitted On: 2024-12-03 10:42:21

#include <iostream>
#include <unordered_map>
#include <set>

using namespace std;
const int N = 1e6+2;

unordered_map<int, int> ump;
set<int> s;

int main()
{
    int n; scanf("%d", &n);
    for (int i = 0;i < n;i++){
        int a; scanf("%d", &a);
        ump[a]++;
        s.insert(a);
    }
    if (s.size() == n) return printf("%d", (n>>1)+(n&1)), 0;

}