AIUB problem Solution(Quiz)

#include <iostream>
using namespace std;
struct Student{
  int quiz1,quiz2,quiz3;
};
struct Quiz{
    int hight,quantity;
};

int main()
{
    int test,quantity=0,i,j,maxnum=0,Count=0;
    cin >> test;
    Quiz q[test];
    for(i=0; i<test; i++)
    {
        cin >> quantity;
        Student s[quantity];
        int num[quantity];
        for(j=0; j<quantity; j++)
        {
            cin >> s[j].quiz1;
            cin >> s[j].quiz2;
            cin >> s[j].quiz3;
            num[j] = s[j].quiz1 + s[j].quiz2 + s[j].quiz3;
        }
        maxnum=0;
        Count=0;
        for(j=0;j<quantity;j++)
        {
            if(num[j]>maxnum)
            {
                maxnum = num[j];
                Count = 1;
            }
            else if(num[j]==maxnum)
            {
                Count++;
            }
        }
        q[i].hight = maxnum;
        q[i].quantity = Count;
    }
    cout << endl;
    for(i=0;i<test;i++)
    {
        cout << q[i].hight << " " << q[i].quantity<<endl;
    }

    return 0;
}