using System;
using System.Text;
public enum City { Incheon, Kyonggi, Seoul, Jeju }

public struct Student
{
    public string name;
    public string hakbun;
    public string major;
    public double jumsu;
    public City address;
    public void Print()
    {
        Console.WriteLine("이름 :" + this.name);
        Console.WriteLine("학번 :" + this.hakbun);
        Console.WriteLine("전공 :" + this.major);
        Console.WriteLine("주소 :" + this.address);
        Console.WriteLine("점수 :" + this.jumsu);
        Console.WriteLine("~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~");
    }

}

namespace StudentGrad
{
    class Class1
    {
        static void Main(string[] args)
        {

            Student[] student = new Student[4];

            student[0].hakbun = "20801111";
            student[0].major = "컴퓨터전공";
            student[0].name = "Kim";
            student[0].jumsu = (int)4;
            student[0].address = City.Incheon;
            student[0].Print();

            student[1].hakbun = "20802222";
            student[1].major = "물리전공";
            student[1].name = "Lee";
            student[1].jumsu = 4.2;
            student[1].address = City.Kyonggi;
            student[1].Print();

            student[2].hakbun = "20803333";
            student[2].major = "컴퓨터전공";
            student[2].name = "Park";
            student[2].jumsu = 3.4;
            student[2].address = City.Jeju;
            student[2].Print();

            student[3].hakbun = "20804444";
            student[3].major = "수학전공";
            student[3].name = "Jang";
            student[3].jumsu = 3.8;
            student[3].address = City.Seoul;
            student[3].Print();

            double MaxJumsu = 0;

            for (int i = 0; i < student.Length; i++)     //배열의 길이만큼돌면서
            {

                if (student[i].jumsu > MaxJumsu)     //만약 빈칸에 있는수보다 크다면
                {

                    MaxJumsu = student[i].jumsu;     //빈칸에 숫자를 넣는다

                }

            }

            for (int i = 0; i < student.Length; i++) //배열의 길이만큼돌면서
            {

                if (student[i].jumsu == MaxJumsu) //이전에 찾은 가장큰수와 같다면
                {

                    student[0].Print(); //출력한다     

                }

            }
            double SecondMaxJumsu = 0;

            for (int i = 0; i < student.Length; i++) //배열의 길이만큼돌면서
            {

                if (student[i].jumsu > SecondMaxJumsu && student[i].jumsu != MaxJumsu)

                //만약 빈칸에 있는수보다 크다면 , 그리고 가장큰수와 같지않다면
                {

                    MaxJumsu = student[i].jumsu; //빈칸에 숫자를 넣는다

                }

            }
            for (int i = 0; i < student.Length; i++) //배열의 길이만큼돌면서
            {

                if (student[i].jumsu == MaxJumsu) //이전에 찾은 가장큰수와 같다면
                {

                    student[1].Print(); //출력한다     

                }

            }

            double ThirdMaxJumsu = 0;
            for (int i = 0; i < student.Length; i++)
            {
                if (student[i].jumsu > ThirdMaxJumsu && student[i].jumsu != MaxJumsu)
                {
                    MaxJumsu = student[i].jumsu;
                }
            }
            for (int i = 0; i < student.Length; i++)
            {

                if (student[i].jumsu == MaxJumsu)
                {

                    student[2].Print();      

                }

            }

            double FourthMaxJumsu = 0;
            for (int i = 0; i < student.Length; i++)
            {
                if (student[i].jumsu > FourthMaxJumsu && student[i].jumsu != MaxJumsu)
                {
                    MaxJumsu = student[i].jumsu;
                }
            }
            for (int i = 0; i < student.Length; i++)
            {

                if (student[i].jumsu == MaxJumsu)
                {

                    student[3].Print();   

                }

            }

                Console.ReadLine();

        }
    }
}

쓰다보니 코드가 좀 길어졌군요..

이런코드인데 배열을 이용해서 제가 연구를 해봤는데 정렬이안되더라구요..

이것저것 태클 많이 걸어주셔두 좋은데 어디부분이 틀렸는지 좀 알려주세요 ㅠㅠ 수정좀하게..

머리아파 죽겠네요.. 여기서 정렬순서는

점수가 높은순서로 정렬시키는것입니다...

우리 프겔러들의 힘을 믿어보겠삼 -ㅅ-..