7 row K with the weakest combat effectiveness in the matrix

7  The weakest in the matrix K That's ok

author : Turbo The time limit : 1S chapter :  curriculum design

Problem description :

Give you a size of m * n Matrix mat, The matrix consists of a number of soldiers and civilians , Use them separately 1 and 0 Express .

Please return to the weakest in the matrix k Index of rows （ Line number ）, Sort by weakest to strongest .

If the first i The number of soldiers in line is less than the number of j That's ok , Or two lines of soldiers in the same number but i Less than j, So we think the i The battle effectiveness of the line is better than the first j Row weakness .

Soldiers Always The front position in a row , in other words 1 Always in 0 Before .

Example 1：

Input ：

5 5

1 1 0 0 0 

1 1 1 1 0 

1 0 0 0 0 

1 1 0 0 0 

1 1 1 1 1

3

Output ：

2 0 3

explain ：

The number of soldiers in each line ：

That's ok 0  Yes  2  people

That's ok 1  Yes  4  people

That's ok 2  Yes  1  people

That's ok 3  Yes  2  people

That's ok 4  Yes  5  people

Sort these rows from the weakest to the strongest to get [2,0,3,1,4]

Example 2：

Input ：

4 4

1 0 0 0 

1 1 1 1 

1 0 0 0 

1 0 0 0

2

Output ：

0 2

explain ： 

The number of soldiers in each line ：

That's ok 0  Yes  1  people

That's ok 1  Yes  4  people

That's ok 2  Yes  1  people

That's ok 3  Yes  1  people

Sort these rows from the weakest to the strongest to get [0,2,3,1]

Enter description :

Enter several lines ：

Enter two integers on the first line m and n, Represents the number of rows and columns of the matrix .

after m That's ok , Enter... On each line n It's an integer （0 or 1） Represents the elements of the matrix .

Enter an integer in the last line k(1 <= k <= m).

Tips ：

    2 <= n, m <= 100

    1 <= k <= m

     The elements of a matrix No 0 Namely 1

The output shows that :

Output one line k It's an integer , Each integer is followed by a space .

Input example :

4 4
1 0 0 0
1 1 0 0
1 0 0 0
1 1 1 0
3 

Output example :

0 2 1 

#include<iostream>
#include<algorithm>
using namespace std;

struct student
{
	
		int line= -1;
		int number= 0;

};
bool cmp(student x, student y)
{
	if (x.number == y.number)
		return x.line < y.line;
	else
		return x.number < y.number;
}
int main()
{
	int arr[500][500];
	student m[100];
	int x = 0; 
	int y = 0;
	cin >> x >> y;

	for (int i = 0; i < x; i++)
	{
		m[i].line = i;		
		for (int u = 0; u < y; u++)
		{
			cin >> arr[x][u];
			if (arr[x][u] == 1)
			{
				m[i].number++;
			}
		}
	}

	int k = 0;
	cin >> k;
	sort(m, m + x, cmp);
	for (int i = 0; i < k; i++)
	{
		cout << m[i].line;

			cout << " ";
	}

	return 0;
}