using System;
using System.Linq;
using System.Runtime.InteropServices;
int[] newarr = new int[10];
int[] newarr2 = new int[5] { 1, 2, 3, 4, 5 };
int[] newarr3 = { 1, 2, 3, 4, 5 };
int[,] newarr4 = new int[2, 3] { { 1, 2, 3 }, { 2, 3, 4 } };
int[,,] newarr5 = new int[2, 3, 4];
for (int i = 0; i < 2; i++)
for (int j = 0; j < 3; j++)
for (int k = 0; k < 4; k++)
{
newarr5[i, j, k] = i + j + k;
}
Console.WriteLine(newarr3.GetLength(0));
Console.WriteLine(newarr3.GetUpperBound(0));
newarr3.CopyTo(newarr2, 2);
Console.WriteLine(Array.BinarySearch(newarr4, 4));
Array.Sort(newarr2);
Console.WriteLine();
foreach (int i in newarr2)
Console.WriteLine(i);
Console.WriteLine(newarr3.Max());
Console.WriteLine(newarr3.Min());
Console.WriteLine(newarr3.Average());
Console.WriteLine(newarr3.Rank);
Array.Clear(newarr4);
Array.Reverse(newarr2);
int[][] student_grade = new int[3][];
student_grade[0]=new int[3] {3,4,5 };
student_grade[1]=new int[4] {3,4,5,2 };
student_grade[2]=new int[2] {3,4, };
for (int i = 0; i < 3; i++)
{
for (int j = 0; j < student_grade[i].Length; j++)
Console.WriteLine(student_grade[i][j]+"");
Console.WriteLine();
}
foreach(int i in newarr3)
Console.WriteLine();
// Найти кол-во элементов в массиве больше заданного элемента
int a=int.Parse(Console.ReadLine());)
int k = 0;
foreach (int i in newarr2)
{
if (i > a) ;
k++;
}
Console.WriteLine(k);