Próblém B. Comparator Input file: Output file: standard input standard output 2 seconds Time limit: Memory limit: 64 megabytes You are given a list of n integers S = sl, s2, ., sn and a list of m integers Q = q1, q2, ..., qm. If sum of first list less than sum of second list, print the numbers from S and otherwise print the numbers from Q. Input First line one integer - N,size of array. Next N lines - integers, elements of array S. Then new line with one integer - M,size of array. Next M lines - integers, elements of array Q. Output List of numbers Examples standard input standard output 732 732 9649 4428 3821 7098 2756 1599 377 7567 2000 9294 1703 1125 1727 1308 1447 5566 5256 3436 2614 8742 2000 9294 1703

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

C++ SIMPLE CODE

Problem B. Comparator
Input file:
Output file:
standard input
standard output
2 seconds
Time limit:
Memory limit:
64 megabytes
You are given a list of n integers S = s1, s2, ., sn and a list of m integers Q = q1, q2, ..., qm. If sum of
first list less than sum of second list, print the numbers from S and otherwise print the numbers from Q.
Input
First line one integer - N,size of array. Next N lines - integers, elements of array S. Then new line with
one integer - M,size of array. Next M lines - integers, elements of array Q.
Output
List of numbers
Examples
standard input
standard output
1
732
732
8.
9649 4428 3821 7098 2756 1599 377
7567
2000 9294 1703
1125 1727 1308 1447 5566 5256 3436
2614 8742
3
2000 9294 1703
Transcribed Image Text:Problem B. Comparator Input file: Output file: standard input standard output 2 seconds Time limit: Memory limit: 64 megabytes You are given a list of n integers S = s1, s2, ., sn and a list of m integers Q = q1, q2, ..., qm. If sum of first list less than sum of second list, print the numbers from S and otherwise print the numbers from Q. Input First line one integer - N,size of array. Next N lines - integers, elements of array S. Then new line with one integer - M,size of array. Next M lines - integers, elements of array Q. Output List of numbers Examples standard input standard output 1 732 732 8. 9649 4428 3821 7098 2756 1599 377 7567 2000 9294 1703 1125 1727 1308 1447 5566 5256 3436 2614 8742 3 2000 9294 1703
Expert Solution
steps

Step by step

Solved in 2 steps with 3 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