#include <stdio.h>
#include <stdlib.h>

typedef struct records
{
    int num;
    int note;
} Record;
void sortArray(int *number, int n);
int main()
{   int r;
    Record record[100];
    FILE *ptr;
    if ((ptr = fopen("Ogrenci.dat", "r")) == NULL)
    {
        printf("Dosya bulunamadi!");
        system("pause");
        return 1;
    }
    int i = 0;
    int num=0;
    int note=0;
    while (!feof(ptr)) {
        fscanf(ptr, "%d %d", &num, &note);
        record[i].num=num;
        record[i].note=note;
        printf("%d ",record[i].num);
        printf("%d",record[i].note);
        printf("\n");
        i++;
    }
    int recordSize=i;
    int allNotes[100];
    **0;
    while(i<recordSize){
        allNotes[i]=record[i].note;
        i++;
    }
    sortArray(allNotes,recordSize);
    **1;
    int count=1;
    int mostFrequent=allNotes[0];
    for(i;i<recordSize;i++){
        if(mostFrequent==allNotes[i]){
            count++;
        }
        else
        {
            break;
        }
    }
    int countSecondary=0;
    int frequentSecondary=allNotes[i-1];
    for(i;i<recordSize;i++){
        if(frequentSecondary==allNotes[i]){
            countSecondary++;
        }
        else
        {
            if(count<countSecondary){
                mostFrequent=frequentSecondary;
                count=countSecondary;
                if(i+1<recordSize){
                    frequentSecondary=allNotes[i+1];
                    countSecondary=0;
                }
                else
                {
                    break;
                }
                
            }
        }
        
    }
    printf("Bu sinifta en cok yigilmanin oldugu not : %d tur (%d tane)\n",mostFrequent,count);
    printf("Bu notu alan ogrencilerin\n");
    printf("NUMARASI : NOTU :\n");
    printf("-------- : ---- :\n");
    int j=0;
    for(j;j<recordSize;j++){
        if(mostFrequent==record[j].note){
            printf("%d",record[j].num);
            printf("   ");
            printf("%d",mostFrequent);
            printf("\n");
        }
    }
    fclose(ptr);
    
    return 0;
}

void sortArray(int *number, int n)
{
    int i = 0;
    int j = 0;
    int temp=0;
    for (i = 0; i < n; ++i)
    {
        for (j = i + 1; j < n; ++j)
        {
            if (number[i] > number[j])
            {
                temp = number[i];
                number[i] = number[j];
                number[j] = temp;
            }
        }
    }
}