P21797 [GeeksforGeeks] Sum of distinct elements4801
普及-
题目描述

You are given an array Arr of size N. Find the sum of distinct elements in an array.
Example 1:
Input:
N = 5
Arr[] = {1, 2, 3, 4, 5}
Output: 15
Explanation: Distinct elements are 1, 2, 3
4, 5. So sum is 15.
Example 2:
Input:
N = 5
Arr[] = {5, 5, 5, 5, 5}
Output: 5
Explanation: Only Distinct element is 5.
So sum is 5.
Your Task:
You don't need to read input or print anything. Your task is to complete the function findSum() which takes the array of integers arr and n as parameters and returns an integer denoting the answer.
Expected Time Complexity: O(NlogN)
Expected Auxiliary Space: O(N
logN)
Constraints:
1 ≤ N ≤ 10^{7}
0 ≤ A[i] ≤ 10^{3}

输入格式

见题面

输出格式

见题面

样例输入
N = 5 Arr[] = {1, 2, 3, 4, 5}
样例输出
15