Advertisement
Guest User

Untitled

a guest
Nov 19th, 2017
58
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.10 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. const int MaxN = 1000;
  6. int n,m;
  7. int a[MaxN][MaxN];
  8. int b[MaxN],d[MaxN];
  9.  
  10. void beolvas()
  11. {
  12. cin >> n >> m;
  13.  
  14. for (int i = 0; i < n; i++)
  15. {
  16. for (int j = 0; j < m; j++)
  17. {
  18. cin >> a[i][j];
  19. }
  20. }
  21. }
  22.  
  23. void atlaghom_es_kiiratas()
  24. {
  25. int b[n],d[n];
  26. int c;
  27.  
  28. for (int i = 0; i < n; i++)
  29. {
  30. b[i] = 0;
  31. d[i] = i+1;
  32. }
  33.  
  34. for (int i = 0; i < n; i++)
  35. {
  36. for (int j = 0; j < m; j++)
  37. {
  38. b[i] += a[i][j];
  39. }
  40. b[i] = b[i] / m;
  41. }
  42.  
  43. for (int i = 0; i < n - 1; i++)
  44. {
  45. for (int j = i + 1; j < n; j++)
  46. {
  47. if (b[i] <= b[j])
  48. {
  49. c = b[i];
  50. b[i] = b[j];
  51. b[j] = c;
  52. c = d[i];
  53. d[i] = d[j];
  54. d[j] = c;
  55. }
  56.  
  57. }
  58. }
  59. for (int i = 0; i < n; i++)
  60. {
  61. cout << d[i]<<endl;
  62. }
  63. }
  64.  
  65.  
  66. int main()
  67. {
  68. beolvas();
  69. atlaghom_es_kiiratas();
  70. return 0;
  71. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement