Submission #4680561

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <set>
using namespace std;
int main(){
    int n;
    cin >> n;
    vector<int> d(n);
    for(int i = 0; i < n; i++)
    {
        cin >> d[i];
    }
    sort(d.begin(),d.end(),greater<int>());
    set<int> dset(d.begin(),d.end());
    cout << dset.size() << endl;
}

Submission Info

Judge Result