关于我CSP-S第一题55这件事

#include<bits/stdc++.h>
using namespace std;
int n,a[100005],cnt;
bool vis1[100005],vis2[100005];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }sort(a+1,a+n+1);
    int ll=1,rr=2;
    while(ll<=n&&rr<=n){
        while(vis1[rr]||vis2[rr]){
			rr++;
     	}while(vis2[ll]){
		 	ll++;
        }while(a[rr]<=a[ll]||rr==ll){
			rr++;
        }if(ll>n||rr>n)break;
        cnt++;
        vis1[rr]=1;
        vis2[ll]=1;
    }cout<<n-cnt;
}

#include<bits/stdc++.h>
using namespace std;
int n,a[100005],cnt;
bool vis1[100005],vis2[100005];
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }sort(a+1,a+n+1);
    int ll=1,rr=2;
    while(ll<=n&&rr<=n){
        while(vis1[rr]||vis2[rr]){
			rr++;
     	}while(vis2[ll]){
		 	ll++;
        }while(a[rr]<=a[ll]||rr==ll){
			rr++;
        if(rr>n)break;
        }if(ll>n||rr>n)break;
        cnt++;
        vis1[rr]=1;
        vis2[ll]=1;
    }cout<<n-cnt;
}