126632024-12-27 18:57:03mártonágnesAranycipők (45)cpp17Wrong answer 1/452ms596 KiB
/**
N - jatekosok szama
K - aranycipos jatekosok szama
G - egyeni golok szama
maxi - az aranycipot ero golok szama
g - az i-1-ik jatekos goljainak szama
*/
#include <iostream>

using namespace std;

int main()
{
    int N, G, G1, K=1, maxi=1;
    cin >> N;
    cin >> G1;
    maxi=G1;
    int Ki[N+1];
    Ki[K]=1;
    for (int i=2; i<=N; i++)
    {
        cin >> G;
        if (G==maxi) {K++; Ki[K]=i;}
        if (G>maxi) {maxi=G; K=1; Ki[K]=i;}
    }
    cout <<endl<< maxi << endl;
    cout << K << endl;
    for (int j=1; j<=K; j++)
    {
        cout << Ki[j]<<endl;
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base1/45
1Wrong answer0/02ms320 KiB
2Wrong answer0/01ms320 KiB
3Wrong answer0/31ms320 KiB
4Partially correct1/31ms320 KiB
5Wrong answer0/31ms320 KiB
6Wrong answer0/31ms320 KiB
7Wrong answer0/31ms320 KiB
8Wrong answer0/31ms320 KiB
9Wrong answer0/31ms320 KiB
10Wrong answer0/32ms320 KiB
11Wrong answer0/31ms320 KiB
12Wrong answer0/31ms320 KiB
13Wrong answer0/31ms596 KiB
14Wrong answer0/32ms320 KiB
15Wrong answer0/32ms320 KiB
16Wrong answer0/31ms320 KiB
17Wrong answer0/32ms320 KiB