It's final exam week of Jack's cooking class. His class of N students are busy studying for it. Unfortunately, being crammers, each student is only able to study one topic. The i-th student studied topic Si. Topics are numbered 1 to 106. Jack prepared N tasks for exam. He intends to assign each task to exactly one student. Each task requires exactly one topic to pass. The j-th task requires topic Tj. Tom is a sadistic teacher; he doesn't want the students to pass! Therefore, he wants to assign the tasks in such that the number of students assigned to the topic he/she studied for is minimized. Can you please help Jack in developing a C++ code to find any such assignment? If there are multiple possible assignments, you may output anyone. Input: 1 3 100 100 200 100 100 200 Output: 1

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...
icon
Related questions
Question
100%
It's final exam week of Jack's cooking class. His class of N students are busy
studying for it. Unfortunately, being crammers, each student is only able to study
one topic. The i-th student studied topic S. Topics are numbered 1 to 106. Jack
prepared N tasks for exam. He intends to assign each task to exactly one student.
Each task requires exactly one topic to pass. The j-th task requires topic Tj. Tom is a
sadistic teacher; he doesn't want the students to pass! Therefore, he wants to
assign the tasks in such that the number of students assigned to the topic he/she
studied for is minimized. Can you please help Jack in developing a C++ code to
find any such assignment? If there are multiple possible assignments, you may
output anyone.
Input:
1
100 100 200
100 100 200
Output:
1
321
Transcribed Image Text:It's final exam week of Jack's cooking class. His class of N students are busy studying for it. Unfortunately, being crammers, each student is only able to study one topic. The i-th student studied topic S. Topics are numbered 1 to 106. Jack prepared N tasks for exam. He intends to assign each task to exactly one student. Each task requires exactly one topic to pass. The j-th task requires topic Tj. Tom is a sadistic teacher; he doesn't want the students to pass! Therefore, he wants to assign the tasks in such that the number of students assigned to the topic he/she studied for is minimized. Can you please help Jack in developing a C++ code to find any such assignment? If there are multiple possible assignments, you may output anyone. Input: 1 100 100 200 100 100 200 Output: 1 321
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY