129002025-01-03 10:23:29PappMatyasLegtöbb unoka (80 pont)cpp17Accepted 80/80100ms756 KiB
#include <iostream>

using namespace std;

int Des(int A[], int k, int n)
{
    int l = 0;
    for(int i = 0; i < n; i++)
    {
        if(A[i] == k)
        {
            l++;
        }
    }
    return l;
}

int main()
{
    int n, m, A[10000], B[10000], num[10000] = {0}, maxi = 0, save = -1;
    cin >> m >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> A[i] >> B[i];
    }
    for(int i = 0; i < n; i++)
    {
        num[A[i]] += Des(A,B[i],n);
    }
    for(int i = 0; i < m; i++)
    {
        if(num[i] > maxi)
        {
            maxi = num[i];
            save = i;
        }
    }
    if(maxi == 0)
    {
        cout << -1;
    }
    else
    {
        cout << save << " " << maxi;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base80/80
1Accepted0/01ms320 KiB
2Accepted0/027ms536 KiB
3Accepted4/41ms320 KiB
4Accepted4/41ms320 KiB
5Accepted4/4100ms568 KiB
6Accepted4/4100ms584 KiB
7Accepted4/41ms320 KiB
8Accepted4/41ms320 KiB
9Accepted4/427ms536 KiB
10Accepted4/498ms612 KiB
11Accepted4/498ms604 KiB
12Accepted4/427ms532 KiB
13Accepted4/498ms568 KiB
14Accepted4/498ms612 KiB
15Accepted4/498ms572 KiB
16Accepted4/498ms756 KiB
17Accepted4/498ms568 KiB
18Accepted4/498ms616 KiB
19Accepted2/21ms500 KiB
20Accepted2/21ms320 KiB
21Accepted3/31ms320 KiB
22Accepted3/32ms456 KiB
23Accepted3/398ms616 KiB
24Accepted3/398ms616 KiB