2 liner || GREEDY
Intuition\nFind diff between sum of array and goal.\nNow, in order to make both of them same, we need to +/-\nnumbers in array such that sum = goal.\nTo get min
# Intuition\n`Find diff between sum of array and goal.`\n`Now, in order to make both of them same, we need to +/-`\n`numbers in array such that sum = goal.`\n`To get minimum steps,`\n`we keep on doing +/- limit to make sum = goal` \n`as early as possible.`\n\n# Complexity\n- Time complexity: $$O(n)$$ \n\n- Space complexity: $$O(1)$$ \n\n# Code\n```\nclass Solution {\npublic:\n    int minElements(vector<int>& nums, int limit, int goal) {\n        long long sum = accumulate(nums.begin(),nums.end(),0LL);\n        return ceil(1.00*abs(sum-goal)/limit);\n    }\n};\n```
['Greedy', 'C++']