Richest customer wealth

class Solution {
public:
    int maximumWealth(vector<vector<int>>& a) {
        int max_amount = 0;
        for(int i = 0;i<m;i++){
            int customer_amount  = 0;
            for(int j = 0;j<n;j++){
                customer_amount += a[i][j];
            }
            max_amount = max(customer_amount, max_amount);
        }
        return max_amount;
    }
};