236452026-01-27 07:36:39tamasnagyAranycipők (45)cpp17Wrong answer 30/452ms552 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct focimatyi{
    int gol;
    int index;
};
vector<focimatyi>scorer;
vector<int>topscorer;
bool cmp(focimatyi a, focimatyi b){
    return a.gol>b.gol;
}

int main()
{
    int n;
    //scorer.resize(n);
    cin>>n;
    for(int i=1; i<=n; i++){
        int a;
        cin>>a;
        scorer.push_back({a,i});
    }
    sort(scorer.begin(), scorer.end(), cmp);
    cout<<scorer[0].gol<<endl;
    int i=0;
    int db=0;
    while(scorer[i].gol==scorer[0].gol){
        db++;
        i++;
        topscorer.push_back(scorer[i].index);
    }
    cout<<db<<endl;
    sort(topscorer.begin(),topscorer.end());
    for(int j=0; j<topscorer.size();j++){
        cout<<topscorer[j]<<endl;
    }


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base30/45
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms500 KiB
3Partially correct2/31ms316 KiB
4Partially correct2/31ms316 KiB
5Partially correct2/31ms316 KiB
6Partially correct2/31ms316 KiB
7Partially correct2/31ms316 KiB
8Partially correct2/31ms316 KiB
9Partially correct2/31ms316 KiB
10Partially correct2/32ms552 KiB
11Partially correct2/31ms316 KiB
12Partially correct2/31ms316 KiB
13Partially correct2/32ms500 KiB
14Partially correct2/32ms316 KiB
15Partially correct2/32ms316 KiB
16Partially correct2/31ms544 KiB
17Partially correct2/32ms316 KiB