PAT A 1124 AC代码

用一个ct记录取位

winner记录一下已经赢过的winner

#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
set<string> winner;
int main(){
	int M,N,S;
	cin>>M>>N>>S;
	int ct=0-S;
	for(int i=1;i<=M;i++){
		string nick;
		cin>>nick;
		ct++;
		if(ct>0&&ct%N==0&&winner.find(nick)==winner.end()){
			cout<<nick<<"\n";
			winner.insert(nick);
		}else if(ct>0&&ct%N==0&&winner.find(nick)!=winner.end()){
			ct--;
		}
	}
	if(winner.size()==0){
		printf("Keep going...");
	}
	return 0;
}