Submission #1696219

---

Source Code Expand

#include <assert.h>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <algorithm>
#include <numeric>
#include <functional>
#include <iostream>
#include <string>
#include <array>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;

using namespace std;

const int MX = 100010;
int A[MX] = {};


int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin >> N;
  for (int i = 0; i < N; i++) {
    int a;
    cin >> a;
    A[a]++;
  }
  int left = 0;
  int right = MX - 1;
  int ans = 0;
  while (left <= right) {
    for (int i = left; i < MX; i++) {
      if (A[i] > 1) {
        left = i;
      }
    }
    for (int i = right; i >= 0; i--) {
      if (A[i] > 1) {
        right = i;
      }
    }
    if (left == right) {
      A[left]--;
      ans--;
      // ans++;
    } else {
      A[left]--;
      A[right]--;
      //ans++;
    }
    if (A[left] <= 1) {
      left++;
    }
    if (A[right] <= 1) {
      right--;
    }
  }
  for (int i = 0; i < MX; i++) {
    if (A[i] > 0) {
      ans++;
    }
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result