제출 #504238

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
504238	2022-01-10 02:53:06	erke	Preokret (COCI18_preokret)	C++11	50 / 50	1 ms	336 KiB

preokret

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
signed main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  vector<int> cnt_a(2881), cnt_b(2881);
  for (int i = 0; i < n; i++) {
    int x; cin >> x;
    cnt_a[x]++;
  }
  int m; cin >> m;
  for (int i = 0; i < m; i++) {
    int x; cin >> x;
    cnt_b[x]++;
  }
  int res2 = 0;
  vector<int> lost_a(2881), lost_b(2881);
  for (int i = 1; i <= 2880; i++) {
    cnt_a[i] += cnt_a[i - 1];
    cnt_b[i] += cnt_b[i - 1];
    if (cnt_a[i] == cnt_b[i]) {
      lost_a[i] = lost_a[i - 1];
      lost_b[i] = lost_b[i - 1];
    }
    else {
      lost_a[i] = (cnt_a[i] < cnt_b[i]);
      lost_b[i] = (cnt_b[i] < cnt_a[i]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 50 / 50