Submission #1243629


Source Code Expand

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

typedef pair<int,int> pii;

int N,K;
int A[1010];
vector<pii> V;

int main()
{
    scanf("%d%d",&N,&K);
    for(int i = 0; i < N; i++)
    {
        scanf("%d",&A[i]);
    }
    for(int i = 0; i < N; i++)
    {
        V.push_back(make_pair(A[i],i + 1));
        sort(V.begin(),V.end());
        if(i >= K - 1)
        {
            printf("%d\n",V[K - 1].second);
        }
    }
    return 0;
}

Submission Info

Submission Time
Task B - 特別賞
User unit
Language C++14 (GCC 5.4.1)
Score 40
Code Size 470 Byte
Status RE
Exec Time 98 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:12:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&N,&K);
                        ^
./Main.cpp:15:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&A[i]);
                          ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 40 / 40 0 / 60
Status
AC × 2
AC × 13
AC × 13
WA × 3
RE × 6
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt
Subtask2 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 17 ms 256 KB
subtask1_06.txt AC 17 ms 256 KB
subtask1_07.txt AC 17 ms 256 KB
subtask1_08.txt AC 8 ms 256 KB
subtask1_09.txt AC 27 ms 256 KB
subtask1_10.txt AC 8 ms 256 KB
subtask1_11.txt AC 27 ms 256 KB
subtask2_01.txt RE 97 ms 256 KB
subtask2_02.txt WA 6 ms 256 KB
subtask2_03.txt RE 96 ms 256 KB
subtask2_04.txt RE 96 ms 256 KB
subtask2_05.txt RE 97 ms 256 KB
subtask2_06.txt WA 8 ms 256 KB
subtask2_07.txt RE 96 ms 256 KB
subtask2_08.txt WA 8 ms 256 KB
subtask2_09.txt RE 98 ms 256 KB