Submission #7022074

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
int main() {
  int n,m,count=1;
  cin>>n;
  vector<int> a(n);
  for(int i=0;i<n;i++)cin>>a[i];
  sort(a.begin(),a.end());
  m=a[a.size()-1];
  for(int i=0;i<n;i++){
    if(a[a.size()-1]==m)a.pop_back();
    else{
      count++;
      m=a[a.size()-1];
    }
  }
  cout<<count<<endl;
}

Submission Info

Judge Result