title: Distributing Medals solution in Java
body: <p>Distributing Medals  It's the medal distribution ceremony. 10^6 police officers, numbered from 1 to 10^6, are standing in a line. There are <code>N (1&lt;=N&lt;=1000)</code> iterations of medal distribution. In iteration <code>i</code> <code>(0 &lt; = i &lt; N), count[i] ( 1 &lt; = count[i] &lt; = 100)</code> medals are given to all officers from <code>from[i] to to[i] ( 1 &lt; = from[i] &lt; = to[i] &lt; = 10^6 )</code></p>
  
  <p>If we sum up the number of medals received starting from the first officer, who would be the first officer for which the cumulative sum exceeds a given medal <code>count THRESHOLD ( 1 &lt; = THRESHOLD &lt; = 10^9 )</code>? </p>
  
  <p>Input/Output Specifications Input format:</p>
  
  <p>You are given 5 inputs:</p>
  
  <ol>
  <li>input1 = N, the number of iterations</li>
  <li>input2 = count, the array of medal counts in each iteration</li>
  <li>input3 = from, the array of starting indices in each iteration</li>
  <li>input4 = to, the array of ending indices in each iteration</li>
  <li>input5 = THRESHOLD, the medal count threshold</li>
  </ol>
  
  <p>Output format:</p>
  
  <p>An integer, representing the number of the first officer such that the cumulative sum of medals starting from the first officer upto this officer exceeds THRESHOLD. The output should be -1 if such an officer does not exist.</p>