You are viewing a single comment's thread. Return to all comments →
int n = expenditure.size(); if(n <= d) return 0;
for(int i=0; i
sort(v.begin(), v.end());
for(int i=d; i= (2*median)) notifications++; v.erase(find(v.begin(), v.end(),expenditure[i-d]));
//binary search auto it = lower_bound(v.begin(), v.end(), expenditure[i]); v.insert(it, expenditure[i]);
}
return notifications; }
Seems like cookies are disabled on this browser, please enable them to open this website
Fraudulent Activity Notifications
You are viewing a single comment's thread. Return to all comments →
int n = expenditure.size(); if(n <= d) return 0;
for(int i=0; i
sort(v.begin(), v.end());
for(int i=d; i= (2*median)) notifications++; v.erase(find(v.begin(), v.end(),expenditure[i-d]));
}
return notifications; }