Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- const int MaxN = 1000;
- int n,m;
- int a[MaxN][MaxN];
- int b[MaxN],d[MaxN];
- void beolvas()
- {
- cin >> n >> m;
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- cin >> a[i][j];
- }
- }
- }
- void atlaghom_es_kiiratas()
- {
- int b[n],d[n];
- int c;
- for (int i = 0; i < n; i++)
- {
- b[i] = 0;
- d[i] = i+1;
- }
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < m; j++)
- {
- b[i] += a[i][j];
- }
- b[i] = b[i] / m;
- }
- for (int i = 0; i < n - 1; i++)
- {
- for (int j = i + 1; j < n; j++)
- {
- if (b[i] <= b[j])
- {
- c = b[i];
- b[i] = b[j];
- b[j] = c;
- c = d[i];
- d[i] = d[j];
- d[j] = c;
- }
- }
- }
- for (int i = 0; i < n; i++)
- {
- cout << d[i]<<endl;
- }
- }
- int main()
- {
- beolvas();
- atlaghom_es_kiiratas();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement