If there are $n$ customers numbered $1$ to $n$, and customer number $i$ pays $x_i$, you want to choose customer $i$ with probability $p_i = x_i/t$ where $t = \sum_{i=1}^n x_i$. To actually do the selection, take a pseudo-random number $X \in [0,1]$, and choose the first $j$ such that $\sum_{i=1}^j p_i > X$.