4.20 LAB: Who is the best? Learning Objectives In this lab we will: Use if-else statements to find the highest score amongst a group of 3 values Use data structures to retrieve the name that corresponds to the highest score (potentially, in a data structure that makes this easier) Main Idea The problem presented in this lab is an active research area in Computer Science called differential privacy and secure (multi-party) computation. In this lab, we won't be able to use a differentially private algorithm, so we will assume that the users stored their data secretly somewhere and cannot see each other's values. Three friends finished the test and want to secretly compare their test scores. They do not want to know each other's exact score, but they do want to know who achieved the best results for this test. Instructions Input the names and scores of the three friends one after another. (Check out the example input below) Your program should store both names and scores. Think about types to store and structures to store (You can do it in many ways, but we suggest tuples or named tuples or just separate variables. Compare the scores and find the highest. 3.1. If there is one best score - print the name of the friend that achieved that score. 3.2. If there are two friends with equal highest scores - print both names, separated by space, in the order of input. 3.3. If all three friends achieved equal scores - print all three names, separated by space, in the order of input. Examples Input Ann 10 Maria 9 Cindy 7 Output Ann Input Ann 10 Maria 9 Cindy 10 Output Ann Cindy Input Ann 10 Maria 10 Cindy 10 Output Ann Maria Cindy

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

4.20 LAB: Who is the best?

Learning Objectives

In this lab we will:

Use if-else statements to find the highest score amongst a group of 3 values
Use data structures to retrieve the name that corresponds to the highest score (potentially, in a data structure that makes this easier)

Main Idea

The problem presented in this lab is an active research area in Computer Science called differential privacy and secure (multi-party) computation. In this lab, we won't be able to use a differentially private algorithm, so we will assume that the users stored their data secretly somewhere and cannot see each other's values.

Three friends finished the test and want to secretly compare their test scores. They do not want to know each other's exact score, but they do want to know who achieved the best results for this test.

Instructions

Input the names and scores of the three friends one after another. (Check out the example input below)
Your program should store both names and scores. Think about types to store and structures to store (You can do it in many ways, but we suggest tuples or named tuples or just separate variables.
Compare the scores and find the highest.

3.1. If there is one best score - print the name of the friend that achieved that score.

3.2. If there are two friends with equal highest scores - print both names, separated by space, in the order of input.

3.3. If all three friends achieved equal scores - print all three names, separated by space, in the order of input.

Examples

Input

Ann 10 Maria 9 Cindy 7

Output

Ann

Input

Ann 10 Maria 9 Cindy 10

Output

Ann Cindy

Input

Ann 10 Maria 10 Cindy 10

Output

Ann Maria Cindy

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions