138702025-01-09 07:02:46sklausAranycipők (45)cpp17Wrong answer 15/4554ms32000 KiB
#include <iostream>
#include <algorithm>

using namespace std;

struct jatekos
{
    int sorszam, golok;
};

int kevesebb(jatekos x1, jatekos x2)
{
    if(x1.golok<=x2.golok)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}


int main()
{
    int n;
    cin >> n;
    jatekos t[n];
    for(int i=0; i<n; i++)
    {
        cin >> t[i].golok;
        t[i].sorszam=i;
    }
    sort(t, t+n, kevesebb);
    cout << t[n-1].golok << endl;
    for(int i=n; i>0; i--)
    {
        if(t[i].golok==t[n-1].golok)
        {
            cout << t[i].sorszam+1 << endl;
        }
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base15/45
1Wrong answer0/01ms316 KiB
2Runtime error0/054ms32000 KiB
3Partially correct1/31ms500 KiB
4Partially correct1/31ms316 KiB
5Partially correct1/31ms316 KiB
6Partially correct1/31ms316 KiB
7Partially correct1/31ms316 KiB
8Partially correct2/31ms316 KiB
9Partially correct1/31ms316 KiB
10Partially correct1/33ms316 KiB
11Partially correct1/33ms316 KiB
12Partially correct1/31ms316 KiB
13Partially correct1/32ms316 KiB
14Partially correct1/32ms316 KiB
15Partially correct1/32ms316 KiB
16Runtime error0/354ms32000 KiB
17Partially correct1/32ms316 KiB