title: How to find the indices of the n largest numbers in an array that aren't 100 in Python
body: <p>I am trying to find the indices of an array of the n largest numbers from largest to smallest that aren't 100 in Python. I have found several different ways to find the top n maximum numbers from an array, and ways to exclude the values that are equal to 100, but not one that preserves the indices as well. This is what the array looks like: </p>
  
  <pre><code>array([ 10,  10,  11,  11,  10,  10,  12,  12,  10,  10,  10,  13,  14,
          14,  15, 100,  15,  12,  13,  11,  10,  12,  14,  14, 100, 100,
         100,  12,  13,  10,  10,  11,  13, 100, 100,  13,  14,  13,  12,
          10,  10,  11,  10, 100, 100, 100,  12,  13,  12,  13,  10,  10,
          10,  15, 100,  14,  14,  11,  12,  12,  10,  10,  10,  15,  15,
          14,  10,  10,  10,  11,  10,  10,  10,  12,  11,  11,  10,  10,
          10,  10,  10,  10,  10,  10,  10,  10,  10,  10,  10,  10,  10,
          10,  10,  10,  10,  10,  10,  10,  10,  10])
  </code></pre>
  
  <p>For an n of 10, I want an output like this:
  array([14, 16, 63, 64, 12, 13, 22, 23, 55, 56])</p>
  
  <p>I am preferably looking for one-liners if possible/an efficient way to perform this without using a traditional if/elif sorter. Let me know if the wording is confusing or if this problem has already been solved. </p>