Baekjoon 1205
등수 구하기


QUESTION ❔



CODE ⌨️

#include <iostream>
#include <algorithm>
#include <cstring>

using namespace std;

int N, S, P;
int score[50];

int lev = 1;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	cin >> N >> S >> P;

	memset(score, -1, sizeof(score));

	for (int i = 0; i < N; i++)
	{
		cin >> score[i];
	}

	if (score[P - 1] >= S)
	{
		cout << -1 << "\n";
	}
	else
	{
		for (int i = 0; i < P; i++)
		{
			if (score[i] > S) lev++;
			else if (score[i] == S) continue;
			else break;
		}

		cout << lev << "\n";
	}

	return 0;
}



RESULT 💛



SIMPLE DISCUSSION ✏️

정렬 관련 문제였다. memset에 관하여 공부하였다.



SOURCE 💎

Baekjoon_Link 👈 Click here


*****
NOT A TALENT ❎ NOT GIVING UP ✅
CopyRight ⓒ 2022 DCherish All Rights Reserved.