Priority Queue using Vector

Question

I am trying to develop Priority Queue using vector. For inserting elements I need to check if the inserted objects have greater key I want to shift them. In short, I want to store objects in vector in sorted manner (sort by key). I need help for that.
The code I have created so far is like this:
import PriorityQueue;
import java.util.*;
import java.io.*;
public class PQItem
     private Object e;
     private int k;
     public PQItem(int key, Object element)
          k=key;
          e=element;
     public int key(){ return k;}
     public Object elelment(){ return e;}
     public void setkey(int key){k=key;}
     public void setElement(Object element){e=element;}
     public static void main(String args[])
          FileReader fr;
          fr = openfile();
     public static FileReader openfile()
          String line,name,file="test.txt";
          int vsize,k1,i1=0;
          boolean flag;
          Object e1,e2;
          //Vector v = new Vector();
          PriorityQueue q=new PriorityQueue();
          try
               FileReader fr=new FileReader(file);
               BufferedReader inFile = new BufferedReader(fr);
               String del=",";
               line=inFile.readLine();
               StringTokenizer tokenizer=new StringTokenizer(line,del);
               while(line!=null)
                    tokenizer = new StringTokenizer(line,del);
                    k1 = Integer.parseInt(tokenizer.nextToken());
                    e1 = tokenizer.nextToken();
                    //System.out.println(line);
                    q.InsertItem(line,i1);
                    line=inFile.readLine();
                    i1++;
               flag=q.isEmpty();
               System.out.println(flag);
               vsize=q.size();
               System.out.println(+vsize);
               e2=q.last();
               System.out.println(e2);
          }//try
          catch(FileNotFoundException exception)
               System.out.println("The File "+file+" was not found");
          catch(IOException exception)
               System.out.println(exception);
          return null;
     }//filereader
//The other file is
import java.util.*;
public class PriorityQueue
     private Object[] a;
     Vector v = new Vector();
     //Constructor
     public PriorityQueue()
     public int size() {return v.size();}
     public boolean isEmpty() { return (v.size())==0;}
     public void InsertItem(Object e,int k)
          v.insertElementAt(e,k);
          //new code
          //for(int i=0;i<size;i++)
     public Object last()
          return v.lastElement();

Answer 1

Why not let Java do the work - use a java.util.TreeSet instead of a Vector.
Make your PQItem implement Comparable, write a compareTo(Object o) method (and an equals method for completeness) and you're golden. Then when you add(pqItem) it goes in the exact spot it belongs.