|
@@ -0,0 +1,122 @@
|
|
|
+#include <iostream>
|
|
|
+#include <vector>
|
|
|
+#include <algorithm>
|
|
|
+
|
|
|
+using namespace std;
|
|
|
+
|
|
|
+bool compare(int a, int b) {
|
|
|
+ return a > b;
|
|
|
+}
|
|
|
+
|
|
|
+int main2() {
|
|
|
+ cout << "halo" << endl;
|
|
|
+ int i = 1;
|
|
|
+ cout << i << endl;
|
|
|
+ return 0;
|
|
|
+}
|
|
|
+
|
|
|
+int main() {
|
|
|
+ int n = 0, tmp = 0;
|
|
|
+ vector<int> tian;
|
|
|
+ vector<int> king;
|
|
|
+ while (cin >> n) {
|
|
|
+ if (n < 1) {
|
|
|
+ break;
|
|
|
+ }
|
|
|
+ int count = 0;
|
|
|
+ for (int i = 0; i < n; i++) {
|
|
|
+ cin >> tmp;
|
|
|
+ tian.push_back(tmp);
|
|
|
+ }
|
|
|
+ for (int i = 0; i < n; i++) {
|
|
|
+ cin >> tmp;
|
|
|
+ king.push_back(tmp);
|
|
|
+ }
|
|
|
+ sort(tian.begin(), tian.end());
|
|
|
+ sort(king.begin(), king.end());
|
|
|
+
|
|
|
+// cout << " > " << endl;
|
|
|
+ for (int i = 0; i < tian.size(); i++) {
|
|
|
+// cout << "index:: " << tian.size() << ":" << i << endl;
|
|
|
+ for (int j = 0; j < king.size(); j++) {
|
|
|
+// cout << king.size() << ":" << j << endl;
|
|
|
+ if (tian.at(i) > king.at(j)) {
|
|
|
+// cout << "i: " << i << "; tian: " << tian.at(i) << "; j: " << j << "; king: " << king.at(j) << endl;
|
|
|
+ tian.erase(tian.begin() + i);
|
|
|
+ king.erase(king.begin() + j);
|
|
|
+ count++;
|
|
|
+ j--;
|
|
|
+
|
|
|
+// cout << "-----" << i << "-" << tian.size() << "-" << j << "-" << king.size() << endl;
|
|
|
+ if (i == tian.size()) {
|
|
|
+ i--;
|
|
|
+// cout << "iiiiii" << i << endl;
|
|
|
+ }
|
|
|
+ if (j == king.size()) {
|
|
|
+ j--;
|
|
|
+ }
|
|
|
+// cout << "----- --- :" << i << ":-:" << tian.size() << ":-:" << j << ":-:" << king.size() << endl;
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+
|
|
|
+// cout << tian.size() << " " << tian.at(0) << endl;
|
|
|
+// tian.erase(tian.begin());
|
|
|
+// cout << tian.size() << " " << tian.at(0) << endl;
|
|
|
+// cout << " < " << endl;
|
|
|
+ for (int i = 0; i < tian.size(); i++) {
|
|
|
+ for (int j = 0; j < king.size(); j++) {
|
|
|
+ if (tian.at(i) == king.at(j)) {
|
|
|
+ cout << "one i: " << i << "; at:" << tian.at(i) << "; size: " << tian.size() << "; j: " << j
|
|
|
+ << "; at" << king.at(j) << "; size: " << king.size() << endl;
|
|
|
+ tian.erase(tian.begin() + i);
|
|
|
+ king.erase(king.begin() + j);
|
|
|
+ j--;
|
|
|
+ if (i >= tian.size()) {
|
|
|
+ i--;
|
|
|
+ }
|
|
|
+ if (j >= king.size()) {
|
|
|
+ cout << "j - size:" << (j - king.size()) << endl;
|
|
|
+ cout << "j: " << j << "; size: " << king.size() << "; j > size:" << (j < king.size()) << endl;
|
|
|
+ j--;
|
|
|
+ }
|
|
|
+ cout << "two i: " << i << "; at:" << tian.at(i) << "; size: " << tian.size() << "; j: " << j
|
|
|
+ << "; at" << king.at(j) << "; size: " << king.size() << endl;
|
|
|
+ continue;
|
|
|
+ }
|
|
|
+ }
|
|
|
+ }
|
|
|
+
|
|
|
+
|
|
|
+// cout << " = " << endl;
|
|
|
+// for (int i = 0; i < tian.size(); i++) {
|
|
|
+// for (int j = 0; j < king.size(); j++) {
|
|
|
+// if (tian.at(i) < king.at(j)) {
|
|
|
+// cout << "i: " << i << "; -" << tian.at(i) << "; j: " << j << "; -" << king.at(j) << endl;
|
|
|
+// tian.erase(tian.begin() + i);
|
|
|
+// king.erase(king.begin() + j);
|
|
|
+// count--;
|
|
|
+// j--;
|
|
|
+// continue;
|
|
|
+// }
|
|
|
+// }
|
|
|
+// }
|
|
|
+ count -= tian.size();
|
|
|
+
|
|
|
+ cout << count * 100 << endl;
|
|
|
+
|
|
|
+// for (int j = 0; j < tian.size(); ++j) {
|
|
|
+// cout << tian.at(j);
|
|
|
+// }
|
|
|
+// cout << endl;
|
|
|
+// for (int j = 0; j < king.size(); ++j) {
|
|
|
+// cout << king.at(j);
|
|
|
+// }
|
|
|
+// cout << endl;
|
|
|
+ tian.clear();
|
|
|
+ king.clear();
|
|
|
+ }
|
|
|
+ return 0;
|
|
|
+}
|