Bug in Given input output of the question MINRPC problem

help
,
1

My issue

Input
2
PS
this is the second example test case the output should be PR as lexographaically
smallest string But the output provided is SR
Reason:
because if we don’t change the p we will draw, And in the case of S->R then the chef will win so the ans will be PR which is lexographically the smallest string.

My code

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

int main() {
	// your code goes here

}

Problem Link: Rock-Paper-Scissors Practice Coding Problem - CodeChef

2

@gangwar_1802
it is given that he needs to win more than n/2 time .
but for pr it will win only n/2 time not more than n/2 .