Submission #824087

#TimeUsernameProblemLanguageResultExecution timeMemory
824087ajayUtrka (COCI14_utrka)C++14
80 / 80
92 ms10340 KiB
/* Ajay Jadhav */ #include <iostream> #include <cstdio> #include <algorithm> #include <deque> #include <vector> #include <cstdlib> #include <iomanip> #include <cmath> #include <queue> #include <map> #include <set> #include <stack> #include <ctime> #include <string.h> #include <climits> #include <cstring> using namespace std; #define ll long long #define pb push_back #define pii pair<int, int> #define vi vector<int> #define vii vector<pii> #define mi map<int, int> #define mii map<pii, int> #define all(a) (a).begin(), (a).end() #define x first #define y second #define sz(x) (int)x.size() #define hell 1000000007 #define rep(i, a, b) for (int i = a; i < b; i++) #define endl '\n' void solve() { int n; cin >> n; map<string, int> winners; rep(i, 0, n) { string s; cin >> s; winners[s]++; } rep(i, 0, n - 1) { string s; cin >> s; winners[s]--; } for (auto it : winners) { if (it.second > 0) { cout << it.first << endl; } } } signed main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t = 1; // cin>>t; while (t--) { solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...