Stackoverflow interview problem 38384537 "minimum unique array sum", C#

Language: Layout:

//Rextester.Program.Main is the entry point for your code. Don't change it.
//Compiler version 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

// see problem at http://stackoverflow.com/questions/38384537/minimum-unique-array-sum/

using System;
using System.Collections.Generic;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            F();
            F2();
        }

private static int F()
        {
            int[] a = {2, 2, 2, 3, 8, 9}; // sorted list
                
            int n = 0; // num
            int p = 0; // prev; zero is an invalid value in the list
            int q = 0; // queue
            int s = 0; // sum
            
            for (int i = 1; i < a.Length; i++)
            {
                n = a[i];
                if (n == p)
                {
                    q++; // increment queue on duplicate number
                }
                else
                {
                    // for every hole between array values, decrement queue and add to the sum
                    for (int j = 1; q > 0 && j < n - p; j++)
                    {
                        q--;
                        s += p + j;
                        Console.WriteLine("Add: {0}", p + j);
                    }
                    s += (p = n);
                    Console.WriteLine("Add: {0}", n);
                }
            }
            // flush the queue
            for (; q > 0; q--)
            {
                s += ++n;
                Console.WriteLine("Add: {0}", n);
            }

Console.WriteLine("Sum: {0}", s);
            return s;
        }
        
        private static int F2()
        {
            int[] a = {1, 1, 8, 8, 8, 8, 8}; // sorted list
                
            int n = 0; // num
            int p = 0; // prev; zero is an invalid value in the list
            int q = 0;
            int s = 0; // sum
            Queue<int> h = new Queue<int>(); // holes
            
            for (int i = 1; i < a.Length; i++)
            {
                n = a[i];
                if (n == p)
                {
                    q++; // increment queue on duplicate number
                }
                else
                {
                    for (int j = 1; j < n - p; j++)
                    {
                        if (h.Count - q <= a.Length - i) // optimization
                        {
                            h.Enqueue(p + j);
                            Console.WriteLine("Queue: {0}", p + j);
                        }
                    }    
                    s += (p = n);
                    Console.WriteLine("Add: {0}", n);
                }
            }
            // flush the queue
            for (; q > 0; q--)
            {
                int d = h.Count > 0 ? h.Dequeue() : ++n;
                s += d;
                Console.WriteLine("Add: {0}", d);
            }

Console.WriteLine("Sum: {0}", s);
            return s;
        }        
    }
}

Show compiler warnings [ + ] Show input
Compilation time: 0,14 sec, absolute running time: 0,11 sec, cpu time: 0,09 sec, average memory usage: 14 Mb, average nr of threads: 3