Submission #7154735

---

Source Code Expand

import java.util.*;

public class Main {

  public static void main (String[] args) {

    Scanner sc = new Scanner(System.in);
    
    int N = sc.nextInt();

    int[] a = new int[N];

    for (int i = 0; i < N; i++) {
      a[i] = sc.nextInt();
    }

    sc.close();

    int count = 1;

    Queue<Integer> queue = new ArrayDeque<>();

    int check = a[0]*2;

    int current = 1;

    if (a.length != 1) {

      for (int i = 1; i < 100001; i++) {
      
        // iが箱に入れる整数の場合
        if (i == a[current]) {
          
          if (check != i) {
            count++;
          }
          queue.add(i * 2);

          current++;
          
          if (a.length == current) {
            i = 100001;
          }
        }

        // 2倍の数が超えたとき
        if (check <= i) {
          if (queue.size() != 0) {
            check = queue.poll();
          }
        }
        
      }

    }

    System.out.println(count);

  }

}

Submission Info

Judge Result