Submission #7,144

2023-12-31 13:25:58

cpp17

Accepted 70/70

37ms

4812 KiB

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

int main() {
	int n, k;
	cin >> n >> k;
	vector<int> p(n + 1);
	for (int i = 1; i <= n; i++){
		cin >> p[i];
	}

	int jobb = 0;
	int arany = 0, ezust = 0, bronz = 0;
	for (int i = 1; i <= n; i++) {
		if (p[i] > p[k]) jobb++;
		if (jobb < n / 12) arany = i;
		if (jobb < n / 4 && jobb >= n / 12) ezust = i;
		if (jobb < n / 2 && jobb >= n / 4) bronz = i;
	}

	if (arany < k) arany = 0;
	if (ezust < k) ezust = 0;
	if (bronz < k) bronz = 0;
	cout << arany << "\n" << ezust << "\n" << bronz << "\n";
}

	Sum	Test	Verdict		Time	Memory
base	70/70
		1	Accepted	0/0	3ms	1816 KiB
		2	Accepted	0/0	3ms	2052 KiB
		3	Accepted	0/0	37ms	2972 KiB
		4	Accepted	3/3	3ms	2328 KiB
		5	Accepted	3/3	3ms	2524 KiB
		6	Accepted	3/3	3ms	2776 KiB
		7	Accepted	3/3	3ms	2984 KiB
		8	Accepted	3/3	3ms	3092 KiB
		9	Accepted	3/3	3ms	3052 KiB
		10	Accepted	3/3	3ms	3036 KiB
		11	Accepted	3/3	3ms	3152 KiB
		12	Accepted	3/3	3ms	3288 KiB
		13	Accepted	3/3	3ms	3260 KiB
		14	Accepted	4/4	4ms	3264 KiB
		15	Accepted	4/4	19ms	3596 KiB
		16	Accepted	4/4	23ms	3976 KiB
		17	Accepted	4/4	27ms	3980 KiB
		18	Accepted	4/4	6ms	3876 KiB
		19	Accepted	4/4	8ms	4036 KiB
		20	Accepted	4/4	13ms	4160 KiB
		21	Accepted	4/4	37ms	4812 KiB
		22	Accepted	4/4	37ms	4808 KiB
		23	Accepted	4/4	32ms	4416 KiB