oj.uz

Submission #621053

# Submission time Handle Problem Language Result Execution time Memory
621053 2022-08-03T11:32:17 Z mannshah1211 Utrka (COCI14_utrka) C++14
0 / 80
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
 
int main(){
  int n;
  cin >> n;
  
  string a[n];
  unordered_map <string, int> freq2;
  for(int i = 0; i < n; i++){
    cin >> a[i];
    freq2[a[i]] = 0;
  }
  
  for(int i = 0; i < n; i++){
    freq2[a[i]]++;
  }
  
  unordered_map <string, int> freq;
  
  string b[n - 1];
  for(int i = 0; i < n - 1; i++){
    cin >> b[i];
    freq[b[i]] = 0;
    
  }
  
  
  
  for(int i = 0; i < n - 1; i++){
    freq[b[i]]++;
  }
  
  for(int i = 0; i < n; i++){
    if(freq2[a[i]] != freq[a[i]]){
      cout << a[i];
    }
  }
  return 0;
}

Subtask #1
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -