竞赛评分

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int N = 3;

struct Node
{
	int score, id;
	//内嵌式的比较函数速度更快
	bool operator <(const Node &a) const{
		return score == a.score ? id < a.id : score > a.score;
	}
}a[N];


int main()
{
	int n;
	scanf("%d", &n);
	
	while(n --)
	{
		for(int i = 0; i < N; i ++)
		{
		//scanf遇到空格或者回车会结束，可以把字符串存成字符数组的形式
			char s[10];
			scanf("%s", s);
			
			if(strcmp(s,"right") == 0) a[i].score += 10;
			else if(strcmp(s,"wrong") == 0) a[i].score -= 10;
			a[i].id = i + 1;
		}
	}
	sort(a, a+N);
	for(int i = 0; i < N; i ++)
	{
		printf("(%d,%d)", a[i].id, a[i].score);
		if(a[i].score != a[i+1].score && i < N) printf("\n");
	}
	return 0;
}