package Resource_Selection;

public class resource_select {
  classad classad = new classad();
  int temp[][]=new int[20][20];
  public void resource_select(int a[][],int m, int n,classad que[]){
   int i=0;
    rank rank=new rank();
   int max=rank.rank(a,0,que,n),max_no=0,c;
   while (i<m){
        c=rank.rank(a,i,que,n);
       if (c>max){
   max=c;
   max_no=i;
 }
 i++;
}
    i=0;
   int min=rank.rank(a,0,que,n),min_no=0;
   while (i<m){
    int c=rank.rank(a,i,que,n);
    if (c<min){
      min=c;
      min_no=i;
    }
    i++;
   }
   i=0;
   while (i<n){
       temp[0][i]=a[max_no][i];
       i++;
   }
     if (rank.rank(temp,0,que,n)>min) {
       for (i = 0; i < n; i++) {
         a[min_no][i] = temp[0][i];
       }
     }

  }

}