Please answer in C++ Code Admission to college is just beginning and Chef has also just finished his high school. There are NN colleges, listed from 11 to NN, and listed from 11 to NN. Each college has only one seat left. To apply for a college, each student must submit the same examination, the result of which determines their future, that is, the best student (the highest scorer) gets the first choice of college. Each student has a list of favourite colleges. They will want to get to the top ranked college on their list. If they can't get into it, they'll want to get into a second-ranked college in the middle of their list, and so on. If one vacant college seat is filled, that year's admission closes at that college. Then, people who have applied for that college should look for a lower college in their preferred list as long as it still has vacancies. Looking at the information about MM students, about their exam scores (given as standards) and the college IDs they apply for, find out which college the Chef will attend if you are considered a student with id = 1id = 1. Every student is trying to get into a top college on his or her list of vacancies and if he or she is not likely to attend any of the colleges on his or her list, he or she will not join any college this year. Input Output
Please answer in C++ Code Admission to college is just beginning and Chef has also just finished his high school. There are NN colleges, listed from 11 to NN, and listed from 11 to NN. Each college has only one seat left. To apply for a college, each student must submit the same examination, the result of which determines their future, that is, the best student (the highest scorer) gets the first choice of college. Each student has a list of favourite colleges. They will want to get to the top ranked college on their list. If they can't get into it, they'll want to get into a second-ranked college in the middle of their list, and so on. If one vacant college seat is filled, that year's admission closes at that college. Then, people who have applied for that college should look for a lower college in their preferred list as long as it still has vacancies. Looking at the information about MM students, about their exam scores (given as standards) and the college IDs they apply for, find out which college the Chef will attend if you are considered a student with id = 1id = 1. Every student is trying to get into a top college on his or her list of vacancies and if he or she is not likely to attend any of the colleges on his or her list, he or she will not join any college this year. Input Output
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Transcribed Image Text:Please answer in C++ Code
Admission to college is just beginning and Chef has also just finished his high school. There are NN
colleges, listed from 11 to NN, and listed from 11 to NN. Each college has only one seat left. To apply
for a college, each student must submit the same examination, the result of which determines their
future, that is, the best student (the highest scorer) gets the first choice of college. Each student has a
list of favourite colleges. They will want to get to the top ranked college on their list. If they can't get
into it, they'll want to get into a second-ranked college in the middle of their list, and so on.
If one vacant college seat is filled, that year's admission closes at that college. Then, people who have
applied for that college should look for a lower college in their preferred list as long as it still has
vacancies. Looking at the information about MM students, about their exam scores (given as
standards) and the college IDs they apply for, find out which college the Chef will attend if you are
considered a student with id = 1id = 1. Every student is trying to get into a top college on his or her list
of vacancies and if he or she is not likely to attend any of the colleges on his or her list, he or she will
not join any college this year.
Input
1
22
21
12
212
212
Output
2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY