public void sink(int n)
	{
		while(n*2<=size)
		{
			int k=n*2;
			
			if(k<size && heap[k]<heap[k+1])
			{
				k=k+1;
			}
			
			if(heap[k]<heap[n])
				break;
			
			int i = heap[k];
			
			heap[k]=heap[n];
			
			heap[n]=i;
			
			n=k;
			
		}
	}