Submission

Status:

PPPPPPPPPP

Score: 100

User: Dormon

Problemset: F.Ueka Battle

Language: cpp

Time: 0.341 second

Submitted On: 2024-12-03 10:50:44

#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, cnt1 = 0, cnt2 = 0; scanf("%d", &n);
    for (int i = 0;i < n;i++){
        int a; scanf("%d", &a);
        ump[a]++;
        if (ump[a] == 1)
            cnt1++;
    }
    for (auto [a, b]:ump)
        cnt2 += (b == 1);
    cout << cnt1 - cnt2/2 << '\n';
}