// ***實驗二修改處*** 打開下面這句
// import DataStructures.*;

// ***實驗二修改處*** 加上 "implements PriorityQueue"
public class FSUArray {
// public class FSUArray implements PriorityQueue {
    private int _size;
    private Comparable data[];
    public FSUArray() { _size = 0; data = new Comparable[50]; }
    public int size() { return _size; }
    public void add(Comparable item) { data[_size] = item; ++_size; }
    public Comparable remove() {
	int i, min;
	min = 0;
	for (i=1; i<_size; ++i) {
	    if (data[i].compareTo(data[min]) < 0)
		min = i;
	}
	Comparable ans = data[min];
	--_size;
	data[min] = data[_size];
	return ans;
    }
    public boolean isEmpty() { return _size <= 0; }
}