import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
import java.util.concurrent.CountDownLatch;

// Skrevet av Stein Gjessing 2017 - 2025

public class Minst {
   public static void main(String[ ] args) {
      int [ ] tabell;
      MinstMonitor monitor;
      Runnable runAbl;
      final int ANTTR?D = 64;
      final int ANTPERTR?D = 100000;
      CountDownLatch bariere = new CountDownLatch(ANTTR?D);
      tabell = new int[ANTTR?D * ANTPERTR?D];
      for (int in = 0; in < ANTTR?D * ANTPERTR?D; in++)
        tabell[in] = (int)Math.round(Math.random()*Integer.MAX_VALUE);
      monitor = new MinstMonitor();
      for (int i = 0; i< ANTTR?D; i++)  {
            runAbl = new MinstRun(tabell,i*ANTPERTR?D,
                            ((i+1)*ANTPERTR?D)-1,monitor,bariere);
            new Thread(runAbl).start();
      }
      try {
          bariere.await();
          System.out.println("Minste verdi var: "
                                   + monitor.hentMinste());
      }
      catch (InterruptedException ex){
          System.out.println(" Uventet avbrudd "); System.exit(1);
      }
   }
}
class MinstMonitor {
    private Lock l?s = new ReentrantLock();
    int minstTilN? = Integer.MAX_VALUE;
    int antallFerdigeSubtr?der = 0;
    public void giMinsteVerdi (int minVerdi) {
       l?s.lock();
       try {
          if (minstTilN? > minVerdi) minstTilN? = minVerdi;
       }
       finally {
          l?s.unlock();
       }
    }
    public int hentMinste () {return minstTilN?;}  //Trenger ikke laases
                                       // fordi alle andre operasjoner er ferdige
}
class MinstRun implements Runnable {
    int [ ] tab; int startInd, endInd;
    MinstMonitor mon;
    CountDownLatch bariere;
    MinstRun(int [ ] tb, int st, int en,
             MinstMonitor m, CountDownLatch bariere) {
        tab = tb; startInd = st; endInd = en;
        mon = m; this.bariere = bariere;
    }
    public void run(){
        int minVerdi = Integer.MAX_VALUE;
        for (int ind = startInd; ind <= endInd; ind++)
            if(tab[ind] < minVerdi) minVerdi = tab[ind];
        mon.giMinsteVerdi(minVerdi);
        bariere.countDown();
    }
}