SeaMoney has a feature to transfer money between users. Let's imagine a simple scenario. N usernames-consisting of lowercase Latin characters-each starts with a balance b. Amongst them, T transactions happened, where user ua transfers x amount of money to up. If x is larger than the ua's balance when the transaction happens, the transaction is automatically rejected. Output the final balance of each user. Input The first line contains two numbers N and T (1 < N,T < 1000). Each of the next N following lines contain username u; (1 < |u;| < 10) and integer b; (1 < b; < 10°), denoting the balance of user u;. Following that are T lines, each containing two usernames ua and uz (ua # Ub) followed by an integer x (1 < x < 10º), denoting the amount of money transferred from ua to up . Output Output the balance of all users in alphabetical order.

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
icon
Related questions
Question
Money Transfer
Max. score: 100
SeaMoney has a feature to transfer money between users. Let's imagine a simple scenario.
N usernames--consisting of lowercase Latin characters-each starts with a balance b. Amongst them, T
transactions happened, where user ua transfers x amount of money to ub. If x is larger than the ua's balance
when the transaction happens, the transaction is automatically rejected.
Output the final balance of each user.
Input
The first line contains two numbers N and T (1 < N,T < 1000). Each of the next N following lines contain
username u; (1< ]u;| < 10) and integer b; (1 < b; < 10°), denoting the balance of user u;. Following that
(1 <a< 10°),
are T lines, each containing two usernames ua and up (ua 7 ub) followed by an integer x
denoting the amount of money transferred from ua to ub .
Output
Output the balance of all users in alphabetical order.
Transcribed Image Text:Money Transfer Max. score: 100 SeaMoney has a feature to transfer money between users. Let's imagine a simple scenario. N usernames--consisting of lowercase Latin characters-each starts with a balance b. Amongst them, T transactions happened, where user ua transfers x amount of money to ub. If x is larger than the ua's balance when the transaction happens, the transaction is automatically rejected. Output the final balance of each user. Input The first line contains two numbers N and T (1 < N,T < 1000). Each of the next N following lines contain username u; (1< ]u;| < 10) and integer b; (1 < b; < 10°), denoting the balance of user u;. Following that (1 <a< 10°), are T lines, each containing two usernames ua and up (ua 7 ub) followed by an integer x denoting the amount of money transferred from ua to ub . Output Output the balance of all users in alphabetical order.
Output
Output the balance of all users in alphabetical order.
SAMPLE INPUT
SAMPLE OUTPUT
3 4
amir 12
amir 10
brenda 10
brenda 10
charlie 8
charlie 10
amir brenda 5
brenda charlie 5
charlie amir 20
charlie amir 7
Explanation
NA
Time Limit:
1.0 sec(s) for each input file.
Memory Limit:
256 MB
Source Limit:
1024 KB
Marking Scheme:
Score is assigned when all the testcases pass.
Allowed Languages: Bash, C, C++, C++14, C++17, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, Java 14, JavaScript(Rhino), JavaScript(Node.js), Julia,
Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, Python 3.8, Racket, Ruby, Rust, Scala, Swift-4.1,
Swift, TypeScript, Visual Basic
Transcribed Image Text:Output Output the balance of all users in alphabetical order. SAMPLE INPUT SAMPLE OUTPUT 3 4 amir 12 amir 10 brenda 10 brenda 10 charlie 8 charlie 10 amir brenda 5 brenda charlie 5 charlie amir 20 charlie amir 7 Explanation NA Time Limit: 1.0 sec(s) for each input file. Memory Limit: 256 MB Source Limit: 1024 KB Marking Scheme: Score is assigned when all the testcases pass. Allowed Languages: Bash, C, C++, C++14, C++17, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, Java 14, JavaScript(Rhino), JavaScript(Node.js), Julia, Kotlin, Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, Python 3.8, Racket, Ruby, Rust, Scala, Swift-4.1, Swift, TypeScript, Visual Basic
Expert Solution
steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Adjacency Matrix
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
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education