159152025-03-19 09:22:10zsombAranycipők (45)cpp17Wrong answer 0/451ms508 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    int best;
    vector<int> v(n);
    vector<int> b(0);
    for(int i = 0; i< n; i++){
        cin >> v[i];
        if(v[i] > v[best])best = i;
    }
    int counter = 0;

    for(int i = 0; i< n; i++){
        if(v[i] == v[best]){counter++; b.push_back(i);}
    }

    cout << v[best] << " " << b.size();

    for(int i = 0; i< b.size(); i++){
        cout << b[i];
    }

}
SubtaskSumTestVerdictTimeMemory
base0/45
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/31ms316 KiB
4Wrong answer0/31ms316 KiB
5Wrong answer0/31ms316 KiB
6Wrong answer0/31ms316 KiB
7Wrong answer0/31ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms328 KiB
10Wrong answer0/31ms508 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms508 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/31ms508 KiB
16Wrong answer0/31ms316 KiB
17Wrong answer0/31ms316 KiB