No Idea hackerrank solution

Hi,

Here I solve the No Idea hackerrank solution in Python.

Problem - No Idea hackerrank solution

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 .

No Idea hackerrank solution !

n,m = [int(x) for x in input().split()]

p = [int(x) for x in input().split()]

a = {int(x) for x in input().split()}

b = {int(x) for x in input().split()}

h = 0  

for x in p:

    if x in a:

        h = h + 1

    elif x in b:

        h = h - 1

print(h)

Hope I helped you with the No Idea hackerrank solution.

Happy to help.