We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Sorting
  4. Fraudulent Activity Notifications
  5. Discussions

Fraudulent Activity Notifications

  • aprameya
     + 3 comments

    Test Case 1 and 6 pass but times out for the rest. Can anyone plz comment or help here.

    I am kind of lost here doubting the sorting method provided by python...is it really sorting within stipulated time or not

    # Enter your code here. Read input from STDIN. Print output to STDOUT

#!/bin/python

import sys
import bisect

def findmedian(lst):
    l = len(lst)
    if l%2 == 0:
        med = int(round(float((lst[l/2] + lst[l/2-1])/float(2))))
    else:
        med = lst[l/2]
    return med



def notification(med_arr, arr1, arr):
    notify = 0
    j = 0
    #import ipdb; ipdb.set_trace()
    for i in arr1:
        med = findmedian(med_arr)
        if i >= med*2:
            notify += 1
        med_arr.remove(arr[j])
        j += 1
        bisect.insort(med_arr,i)

    return notify


num, d = raw_input().strip().split(' ')
num, d = [int(num), int(d)]
arr = map(int, raw_input().strip().split(' '))

med_arr = sorted(arr[0:d])
arr1 = arr[d:]

result = notification(med_arr, arr1, arr)
print result