Submission #4665164

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <tuple>
#include <cmath>
#include <algorithm>

using namespace std;


int main() {

    int N;

    cin >> N;

    vector<int> v;

    for (int i = 0; i < N; i++) {
        int d;
        cin >> d;
        v.push_back(d);
    }

    sort(v.rbegin(), v.rend());

    int count = 1;

    int current = v[0];

    for (int i = 1; i < N; i++) {

        if (current != v[i]) {
            current = v[i];
            count += 1;
        }
    }

    cout << count << "\n";


    return 0;
}

Submission Info

Judge Result