Submission #1595416

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(),(x).end()
#define LL long long

using namespace std;

int main(){

    int N;cin>>N;
    int A[N];
    REP(i,N)cin>>A[i];
    set<int> st;
    for(int i=0;i<N;i+=2)st.insert(A[i]);
    sort(A,A+N);
    for(int i=0;i<N;i+=2)st.erase(A[i]);

    cout<<st.size()<<endl;

    return 0;
}

Submission Info

Judge Result