Submission #1947391

---

Source Code Expand

#include <iostream>
#include<cstdlib>
#include<queue>
#include<set>
#include<vector>
#include<string>
#include<algorithm>
#include<stack>
#include<map>
#include<cstdio>
using namespace std;
#define rep(i,a) for(int i=0;i<a;i++)
#define mp make_pair
#define pb push_back
#define P pair<int,int>
int n;
int t[1000];
int main(){
	cin>>n;
	rep(i,n)cin>>t[i];
	sort(t,t+n,greater<int>());
	int ans=0,now=2000000;

	rep(i,n){
		if(now>t[i]){
			now=t[i];
			ans++;
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result