NO IDEA!

 There is an array of  integers. There are also  disjoint sets,  and , each containing  integers. You like all the integers in set  and dislike all the integers in set . Your initial happiness is . For each  integer in the array, if , you add to your happiness. If , you add  to your happiness. Otherwise, your happiness does not change. Output your final happiness at the end. 

Note: Since  and  are sets, they have no repeated elements. However, the array might contain duplicate elements. 

Constraints 
 
 

Input Format

The first line contains integers  and  separated by a space. 
The second line contains  integers, the elements of the array. 
The third and fourth lines contain  integers,  and , respectively.

Output Format

Output a single integer, your total happiness.

Sample Input

3 2
1 5 3
3 1
5 7

Sample Output

1

Explanation

You gain  unit of happiness for elements  and  in set . You lose  unit for  in set . The element  in set  does not exist in the array so it is not included in the calculation. 

Hence, the total happiness is 

CODE:

a=input().split()

m,n=a[0],a[1]

array=input().split()

setA=set(input().split())

setB=set(input().split())

happiness=0

for i in array:

    if i in setA:

        happiness+=1

    elif i in setB:

        happiness-=1

print(happiness)

OTHER CODE:

n, m = input().split()

array = input().split()

A = set(input().split())

B = set(input().split())

# i in A and i in B returns 1 or 0 (i,e True or false)

print(sum((i in A) - (i in B) for i in array))

Comments

Popular posts from this blog