#include<bits/stdc++.h>
using namespace std;
int main(){
priority_queue<int,vector<int>,greater<int> > q;
priority_queue<int,vector<int>,greater<int> > q2;
int num;
scanf("%d",&num);
int ans;
for(int i=0;i<num;i++){
int t;
scanf("%d",&t);
q.push(t);
q2.push(t);
}
int a=q.size();
while(a--){
if(q.top()>q2.top()){
q2.pop();
}
q.pop();
}
ans = q2.size();
printf("%d",ans);
return 0;
}
无视注释即可