sashang

#include <iostream>
#include <algorithm>
#include <functional>
#include <queue>

using namespace std;

int main(int argc, char** argv)
{
    priority_queue<int, vector<int>, function<bool(int,int)>> 

sashang

if (min_heap.size() == max_heap.size())
{
  if (u < max_heap.top())
  {
    max_heap.push(u);
    total += max_heap.top();
  }
  else
  {
    min_heap.push(u);

sashang

defmodule Inversion do

  def summarize(a, b, acc, list_acc) do
    case {a, b} do
      {[], []} -> {list_acc, acc}
      {a, []} -> {list_acc ++ a, acc}
      {[], b} -> {list_acc ++ b, acc}
      {a,b} when hd(a) > hd(b) -> summarize(a, tl(b), length(a) + acc, list_acc ++ [hd(b)])
      {a,b} when hd(a) <= hd(b) -> summarize(tl(a), b, acc, list_acc ++ [hd(a)])
    end

sashang

defmodule Inversion do

  def summarize(a, b, acc, list_acc) do
    case {a, b} do
      {[], []} -> {list_acc, acc}
      {a, []} -> {Enum.reverse(a) ++ list_acc, acc}
      {[], b} -> {Enum.revserse(b) ++ list_acc, acc}
      {a,b} when hd(a) > hd(b) -> summarize(a, tl(b), length(a) + acc, [hd(b) | list_acc])
      {a,b} when hd(a) <= hd(b) -> summarize(tl(a), b, acc, [hd(a) | list_acc])
    end