There are N number of bootball players standing in a circle. BTW they all have a gun in there hands. Each player has there skill (a non-negative integer) and he can only kill those players that have strictly less skill than him. one more thing,all the guns have only one bullet. this roulette can take place in any randome order fortunitly, you have the time stone(Yes the green)one and we can see all the possible outcomes of this scenario. find the outcmes where the total sum of the remaning playres skill is minimum. print the sum.

                                      *** All online Coding problam***
========================================================================
Algorithm Test:

 There are N number of bootball players standing in a circle. BTW they all have a gun 
 in there hands. Each player has there skill (a non-negative integer) and he can only 
 kill those players that have strictly less skill than him. one more thing,all the guns 
 have only one bullet. this roulette can take place in any randome order fortunitly,
 you have the time stone(Yes the green)one and we can see all the possible outcomes
 of this scenario. find the outcmes where the total sum of the remaning playres skill is
 minimum. print the sum.

 Input:
   6
   2 8 3 3 5 5
   
 Output:
   13

Explanation:

   1. First line of sample input is no of playres
   2. Second line of sample input is skill of the playres.

step 1:3 will kill less skill 2
step 2:Both having skill 5 will kill both 3
step 3:8 will kill  5
step 4: skill left 8+5=13
========================================================================


import java.util.Scanner;
import java.util.Arrays;
class FootBoller{
  public static void main(String args[]){
    Scanner sc=new Scanner(System.in);
int n=sc.nextInt();// Number of footboller in the circle
int skill[]=new int[n];//Number of skill in every player
for(int i=0;i<n;i++){
      skill[i]=sc.nextInt();
}
int boolet[]=new int[n];//Every person have a gun
for(int i=0;i<n;i++){// in this gun having one boolet
     boolet[i]=1;
}

    Arrays.sort(skill);//so your skill array will sort Assending order

//Main logic start here only
     Boolean p=true;
     int j=0;
     int k=1;

while(p){
        //check the condition if 
if(k>=n){
          p=false;
  break;
}
else if(skill[j]<skill[k]){//It's means 1 position having more skill compare of 0

if(boolet[k]>0){// At least you have one boolet
               skill[j]=0;
   boolet[k]=0;
   j=j+1;
   k=k+1;
}
else{
              k=k+1;
}
         }
else{
           k=k+1;
}
 
}//while loop


    //Print the sum of all the sill left in the Arrys/footboller
  int sum=0;
  for(int i=0;i<n;i++){
       sum=sum+skill[i];
  }
     System.out.println(sum);
  }
}