fork download
copy 
  1. #include<iostream>
  2. #include<algorithm>
  3.  
  4. using namespace std;
  5.  
  6. void a1(int *arr, int n)
  7. {
  8. 	float a = arr[0];
  9. 	for (int i = 1; i < n; i++)
  10. 	{
  11. 		a = a + arr[i];
  12. 	}
  13. 	a = a / n;
  14. 	cout << a << endl;
  15. }
  16.  
  17. void a2(int *arr, int n)
  18. {
  19. 	int a = arr[n / 2 + n % 2];
  20. 	cout << a << endl;
  21. }
  22.  
  23. void a3(int *arr, int n)
  24. {
  25. 	int most = 0;
  26. 	int highest = 1;
  27. 	int current = 0;
  28. 	int check = 0;
  29. 	for (int i = 0; i < n; i++)
  30. 	{
  31. 		current++;
  32. 		if (i == n - 1 || arr[i] != arr[i + 1])
  33. 		{
  34. 			if (current >= highest)
  35. 			{
  36. 				if (current == highest)
  37. 				{
  38. 					if (check < 2)
  39. 					{
  40. 						highest = current;
  41. 						most = arr[i];
  42. 					}
  43. 					check++;
  44. 				}
  45. 				else
  46. 				{
  47. 					highest = current;
  48. 					most = arr[i];
  49. 				}
  50. 			}
  51. 			current = 0;
  52. 		}
  53. 	}
  54. 	cout << most << endl;
  55. }
  56. void a4(int *arr, int n)
  57. {
  58. 	int max = arr[n - 1];
  59. 	int min = arr[0];
  60. 	cout << max - min << endl;
  61. }
  62. int main()
  63. {
  64. 	int n;
  65. 	cin >> n;
  66. 	int a[n];
  67. 	for (int i = 0; i < n; i++)
  68. 	{
  69. 		cin >> a[i];
  70. 	}
  71. 	sort(a, a + n);
  72. 	a1(a, n);
  73. 	a2(a, n);
  74. 	a3(a, n);
  75. 	a4(a, n);
  76. }
Success #stdin #stdout 0s 4180KB
comments (?)
stdin
copy 
5
1
3
8
-2
2
stdout
copy 
2.4
3
1
10
https://ideone.com/z0Cmu4
language:
C++14 (gcc 8.3)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!