Submission #155930

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <list>
#include <deque>
#include <vector>
#include <algorithm>
#include <map>
#include <stack>
#include <math.h>
#include <complex>
#include <queue>
using namespace std;

int main() {
  int n;

  cin >> n;

  int c[n];

  for (int i = 0; i < n; ++i) {
    cin >> c[i];
  }

  int count = 0;

  for (int i = 1; i < n; i++) {
    int tmp = c[i];
    if (c[i - 1] > tmp) {
      ++count;
      int j = i;
      do {
        c[j] = c[j - 1];
        j--;
      } while (j > 0 && c[j - 1] > tmp);
      c[j] = tmp;
    }
  }

  cout << count << endl;

  //for (int i = 0; i < n; ++i) {
  //  printf("%d ", c[i]);
  //}
}

Submission Info

Judge Result