class Solution {
public:
    long long minimumPossibleSum(int n, int target) 
    {
        long long sum=0;
        unordered_map<int,int>m;
        int cnt=0;
        int i=1;
        while(cnt<n)
        {
            
            if(m.find(i) == m.end())
            {
                sum+=i;
                cnt++;
            }
            m[target-i]++;
            i++;
        }
        return sum;
    }
};