-
Notifications
You must be signed in to change notification settings - Fork 0
/
0152.cpp
74 lines (68 loc) · 1.86 KB
/
0152.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <cstring>
#include <sstream>
using namespace std;
class student{
public:
student(int a, int b){
id = a;
score = b;
}
int id;
int score;
bool operator < (const student arg) const{
if(score == arg.score){
return id < arg.id;
}else{
return score > arg.score;
}
}
};
int main(void){
int n;
while(cin >> n && n){
vector<student> v;
int id,tmp;
string str;
cin.ignore();
for(int i=0;i<n;i++){
getline(cin,str);
istringstream iss(str);
vector<int> score;
iss >> id;
while(iss >> tmp){
score.push_back(tmp);
}
int sum=0;
int fcount=0;
int mul[score.size()];
memset(mul, 0, sizeof(mul));
for(int j=0;j<score.size();j++){
if(score[j] == 10){ //strike
if(j+1 < score.size()) mul[j+1]++;
if(j+2 < score.size()) mul[j+2]++;
sum += 10;
sum += mul[j] * score[j];
}else if(j+1 < score.size()){
if(j+1 < score.size() && score[j] + score[j+1] == 10){ //spare?
if(j+2 < score.size()) mul[j+2]++;
}
sum += score[j]+score[j+1];
sum += score[j]*mul[j] + score[j+1] * mul[j+1];
j++;
}else{
sum += score[j] * (mul[j] + 1);
}
}
v.push_back(student(id,sum));
}
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++){
cout << v[i].id << " " << v[i].score << endl;
}
}
}