Company: Udaan
Difficulty: medium
The current selected programming language is C++14. We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted, you cannot review this problem again. You can use cout to debug your code. The cout may not work in case of syntax/runtime error. The version of GCC being used is 5.5.0. Maximum Daily Revenue A company has a sales record of N products for M days. The company wants to know the maximum revenue received from a given product among the N products each day. Write an algorithm to find the highest revenue received each day. Input Format The first line of the input consists of two space-separated integers - days and products , representing the days (M) and the products in the sales record (N), respectively. The next M lines consist of N space-separated integers - salesRecord , representing the grid of sales revenue (can be positive or negative) received from each product each day. Output Format Print M space-separated integers represe