Largest Row or Column

For a given two-dimensional integer array/list of size (N x M), you need to find out which row or column has the largest sum(sum of all the elements in a row/column) amongst all the rows and columns.

Note :
If there are more than one rows/columns with maximum sum, consider the row/column that comes first. And if ith row and jth column has the same largest sum, consider the ith row as answer.
Input Format :
The first line contains an Integer 't' which denotes the number of test cases or queries to be run. Then the test cases follow.

First line of each test case or query contains two integer values, 'N' and 'M', separated by a single space. They represent the 'rows' and 'columns' respectively, for the two-dimensional array/list.

Second line onwards, the next 'N' lines or rows represent the ith row values.

Each of the ith row constitutes 'M' column values separated by a single space.
Output Format :
For each test case, If row sum is maximum, then print: "row" <row_index> <row_sum>
OR
If column sum is maximum, then print: "column" <col_index> <col_sum>
It will be printed in a single line separated by a single space between each piece of information.

Output for every test case will be printed in a seperate line.
 Consider :
If there doesn't exist a sum at all then print "row 0 -2147483648", where -2147483648 or -2^31 is the smallest value for the range of Integer.
Constraints :
1 <= t <= 10^2
0 <= N <= 10^3
0 <= M <= 10^3
Time Limit: 1sec
Sample Input 1 :
1
2 2 
1 1 
1 1
Sample Output 1 :
row 0 2
Sample Input 2 :
2
3 3
3 6 9 
1 4 7 
2 8 9
4 2
1 2
90 100
3 40
-10 200
Sample Output 2 :
column 2 25
column 1 342



 #include <iostream>

using namespace std;


#include "solution.h"

#include<climits>

void findLargest(int **a, int m, int n)

{

    //Write your code here

    if(m==0 && n==0){

        cout<<"row"<<" "<<n<<" "<< INT_MIN;

    }

    else{

        long int sum_row[n]={0};

        for(int j=0;j<n;j++){

            for(int i=0;i<m;i++){

                sum_row[i]=sum_row[i]+a[i][j];

            }



        }

        int count_row=0;

        int max_row=INT_MIN;

        for(int i=0;i<n;i++){

            if(sum_row[i]>max_row){

                max_row=sum_row[i];

                count_row=i;

            }


        }

        

        

        long int sum_col[n]={0};

        for(int i=0;i<m;i++){

            for(int j=0;j<n;j++){

                sum_col[j]=sum_col[j]+a[i][j];

            }



        }

        int count_column=0;

        int max_column=INT_MIN;

        for(int i=0;i<n;i++){

            if(sum_col[i]>max_column){

                max_column=sum_col[i];

                count_column=i;

            }


        }

        if(max_row>=max_column){

            cout<<"row"<<" "<<count_row<<" "<< sum_row[count_row];

        }

        else{

        

        cout<<"column"<<" "<<count_column<<" "<< sum_col[count_column];

        }

    }

int main()

{

int t;

cin >> t;

while (t--)

{

int row, col;

cin >> row >> col;


int **input = new int *[row];

for (int i = 0; i < row; i++)

{

input[i] = new int[col];

for (int j = 0; j < col; j++)

{

cin >> input[i][j];

}

}


findLargest(input, row, col);

cout << endl;

}

}

Comments

Post a Comment

Popular posts from this blog

Sum of Even Numbers till N

Given a number N, print sum of all even numbers from 1 to N. #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){         if (i%2==0){             sum=sum+i;         }     }     cout<<sum;    } ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #include<iostream> using namespace std; int main(){        /*  Read input as specified in the question. * Print output as specified in the question. */     int sum,n;     cin>>n;     sum=0;     for (int i=1;i<=n;i++){     ...
Read more

Find the Runner-Up Score!

  Given the participants' score sheet for your University Sports Day, you are required to find the runner-up score. You are given     scores. Store them in a list and find the score of the runner-up. Input Format The first line contains  . The second line contains an array     of   integers each separated by a space. Constraints Output Format Print the runner-up score. Sample Input 0 5 2 3 6 6 5 Sample Output 0 5 Explanation 0 Given list is  . The maximum score is  , second maximum is  . Hence, we print   as the runner-up score. ### OPTIMIZED ### from   collections   import   Counter if  __ name__  ==  '__main__' :      n  =  int ( input ())      arr  =  map ( int ,   input () . split ())           lis = list ( Counter ( arr ) . keys ())      lis . sort ()  ...
Read more

Print All Substrings

  For a given input string(str), write a function to print all the possible substrings. Substring A substring is a contiguous sequence of characters within a string. Example: "cod" is a substring of "coding". Whereas, "cdng" is not as the characters taken are not contiguous Input Format: The first and only line of input contains a string without any leading and trailing spaces. All the characters in the string would be in lower case. Output Format: Print the total number of substrings possible, where every substring is printed on a single line and hence the total number of output lines will be equal to the total number of substrings. Note: The order in which the substrings are printed, does not matter. Constraints: 0 <= N <= 10^6 Where N is the length of the input string. Time Limit: 1 second Sample Input 1: abc Sample Output 1: a ab abc b bc c  Sample Input 2: co Sample Output 2: c co o #include <iostream> #include <cstring> us...
Read more