Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- #include <algorithm>
- using namespace std;
- struct player{
- string name;
- int castle[10], score;
- vector<string> beaten;
- vector<string> tied;
- };
- bool psort(player p1, player p2){
- return p1.score > p2.score;
- }
- const int numplayers = 6, win = 2, tie = 1;
- vector<player>players;
- int tmp;
- int main() {
- players.resize(numplayers);
- int summ=0;
- for (int i=0;i<numplayers;i++){
- cin>>players[i].name;
- summ = 0;
- for (int j=0;j<10;j++){
- cin>>players[i].castle[j];
- summ += players[i].castle[j];
- }
- if (summ != 100) players[i].score = -1;
- }
- for (int i=0;i<numplayers;i++){
- for (int j=i+1;j<numplayers;j++){
- tmp = 0;
- for (int k=0;k<10;k++){
- tmp += 1;
- if (players[i].castle[k] > players[j].castle[k]) tmp -= 2;
- }
- if (tmp == 0){
- players[i].score += tie;
- players[j].score += tie;
- players[i].tied.push_back(players[j].name);
- players[j].tied.push_back(players[i].name);
- }
- else if (tmp > 0) players[j].score += win, players[j].beaten.push_back(players[i].name);
- else players[i].score += win, players[i].beaten.push_back(players[j].name);
- }
- }
- sort(players.begin(), players.end(), psort);
- for (int i=0;i<numplayers;i++){
- cout<<players[i].name<<" "<<players[i].score<<"\n";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement