#include <bits/stdc++.h>
using namespace std;
int n, m, ans;
pair<int, int> a[200005];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i].first;
for (int i = 1; i <= n; ++i) cin >> a[i].second;
sort(a + 1, a + n + 1, [](const pair<...
Following Latest ClueOJ Comments's news feed is very easy. Subscribe using the "follow" button on the top right and if you want to, choose the updates by topic or tag.
We will deliver them to your inbox, your phone, or you can use follow.it like your own online RSS reader. You can unsubscribe whenever you want with one click.
Keep up to date with Latest ClueOJ Comments!
Latest ClueOJ Comments: Trang chủ - ClueOJ: Clue Online Judge