Submission #1189900

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    
    long long N;
    long long count = 0;
    
    vector<long long> A;    
    vector<long long> B;
    
    cin >> N;
    
    
    for ( long long  i = 0; i < N; i++ ) {
        long long a;
        cin >> a;
        
        A.push_back(a);
    }
    
    sort( A.begin(), A.end() );
    
    for ( long long  i = 1; i < N; i++ ) {
        
        if ( A[i-1] == A[i] ) {
            B.push_back( A[i] );
        }
    }
    
    
    for ( ;; ) {
        
        if ( B.size() <= 2 ) { break; }
        if ( B.front() == B.back() ) { break;}
        
        B.erase( B.begin() );
        B.pop_back();
        
        count++;
    }
    
    if ( B.front() == B.back() ) {
        count += ( B.size() / 2 );
        count += B.size() % 2;
    }
    else if ( B.size() == 2 ) {
        
        bool is_between = false;
        for ( long long i = 0; i < N; i++ ) {
            if ( B[0] < A[i] && A[i] > B[1] ) {
                is_between = true;
                break;
            }
        }
        if ( is_between ) {
            count++;
        }
        else {
            count += 2;
        }
    }
    
    cout << N - ( count*2 ) << endl;
    
    
    return 0;
}

Submission Info

Judge Result