Min-priority queue without a library heap

Implement a min-priority queue yourself, without a library heap: insert, look at the minimum, and remove the minimum. Give the cost of each operation.