| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1278998 | IBory | Exhibition (JOI19_ho_t2) | C++20 | 44 ms | 1604 KiB |
#include <bits/stdc++.h>
#define pii pair<int, int>
using namespace std;
const int MAX = 100007;
pii P[MAX];
int S[MAX], dp[MAX];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
int N, M;
cin >> N >> M;
for (int i = 0; i < N; ++i) {
int z, v;
cin >> z >> v;
P[i] = { v, z };
}
for (int i = 0; i < M; ++i) cin >> S[i];
sort(S, S + M);
sort(P, P + N);
int ans = 0;
for (int a = N - 1, b = M - 1; a >= 0 && b >= 0; ) {
if (P[a].second <= S[b]) {
ans++;
a--;
b--;
}
else a--;
}
cout << ans;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
