| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1346572 | nathlol2 | Exhibition (JOI19_ho_t2) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, m;
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m;
vector<int> c(m + 1);
vector<pair<int, int>> a(n + 1);
for(int i = 1;i<=n;i++) cin >> a[i].second >> a[i].first;
for(int i = 1;i<=m;i++) cin >> c[i];
sort(a.begin(), a.end()); sort(c.begin(), c.end());
int i = m, j = n, ans = 0;
while(i >= 1 && j >= 1){
if(a[j].second <= c[i]){
++ans; --i; --j;
}else{
--i;
}
}
cout << ans << '\n';
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
