₍₍٩( ᐛ )۶₎₎♪

#include #include #include using namespace std;int main() { int T; cin >> T; cin.ignore(); vector stack; string ps; for(int i=0; i 0) { stack.pop_back(); } else { stack.push_back(p); break; } } } if (stack.size() == 0) { cout

#include #include #include using namespace std;int main() { int T; cin >> T; cin.ignore(); string str; vector answer; for(int i=0; i0) { cout 0) { cout

#include #include #include using namespace std;int main() { int N, K; cin >> N >> K; vector answer; queue num; for(int i=1; i0) { if(i==K) { answer.push_back(num.front()); num.pop(); i=1; } else { temp = num.front(); num.pop(); num.push(temp); i++; } } cout ";}

#include #include using namespace std;int main(){ int N; int maxScore = 0; cin >> N; vector score(N); for(int i=0; i> score[i]; maxScore = maxScore