|
| 1 | +#include <iostream> |
| 2 | +#include <vector> |
| 3 | +#include <algorithm> |
| 4 | +#include <cmath> |
| 5 | +using namespace std; |
| 6 | + |
| 7 | +int main() { |
| 8 | + ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); |
| 9 | + int n, temp; |
| 10 | + //양수: 자신보다 키가 큰 이성과 춤을 추고 싶다. |
| 11 | + //음수: 자신보다 키가 작은 이성과 춤을 추고 싶다. |
| 12 | + vector<int> male_pos; |
| 13 | + vector<int> male_neg; |
| 14 | + vector<int> female_pos; |
| 15 | + vector<int> female_neg; |
| 16 | + |
| 17 | + cin >> n; |
| 18 | + for (int i = 0; i < n; i++) { |
| 19 | + cin >> temp; |
| 20 | + if (temp > 0) male_pos.push_back(temp); |
| 21 | + else male_neg.push_back(abs(temp)); |
| 22 | + } |
| 23 | + for (int i = 0; i < n; i++) { |
| 24 | + cin >> temp; |
| 25 | + if (temp > 0) female_pos.push_back(temp); |
| 26 | + else female_neg.push_back(abs(temp)); |
| 27 | + } |
| 28 | + |
| 29 | + sort(male_pos.begin(), male_pos.end(), greater<int>()); |
| 30 | + sort(male_neg.begin(), male_neg.end(), greater<int>()); |
| 31 | + sort(female_pos.begin(), female_pos.end(), greater<int>()); |
| 32 | + sort(female_neg.begin(), female_neg.end(), greater<int>()); |
| 33 | + |
| 34 | + int cnt = 0; |
| 35 | + int i = 0, j = 0; |
| 36 | + while (i < male_pos.size() && j < female_neg.size()) { |
| 37 | + if (male_pos[i] < female_neg[j]) { |
| 38 | + cnt++; |
| 39 | + i++; |
| 40 | + j++; |
| 41 | + } |
| 42 | + else { |
| 43 | + i++; |
| 44 | + } |
| 45 | + } |
| 46 | + i = 0; j = 0; |
| 47 | + while (i < female_pos.size() && j < male_neg.size()) { |
| 48 | + if (female_pos[i] < male_neg[j]) { |
| 49 | + cnt++; |
| 50 | + i++; |
| 51 | + j++; |
| 52 | + } |
| 53 | + else { |
| 54 | + i++; |
| 55 | + } |
| 56 | + } |
| 57 | + cout << cnt; |
| 58 | + return 0; |
| 59 | +} |
0 commit comments