(long time, int ranks[], int carsToBeRepaired)
| 22 | return ans; |
| 23 | } |
| 24 | public boolean isCarsRepaired(long time, int ranks[], int carsToBeRepaired){ |
| 25 | long carsRepaired = 0; |
| 26 | for (int rank : ranks){ |
| 27 | carsRepaired += (long) (Math.sqrt((1.0 * time) / rank)); |
| 28 | if(carsRepaired>=carsToBeRepaired) return true; |
| 29 | } |
| 30 | return false; |
| 31 | } |
| 32 | } |