# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
884890 | 2023-12-08T15:59:15 Z | banhcuon14 | Exhibition (JOI19_ho_t2) | C++14 | 1 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; #define fi first #define se second typedef pair<int,int > pii; typedef long long ll; const int mod = 1e9 + 7; const int maxn = 5 + 1e5; int n, m; namespace subtask3 { void solve() { vector<pair<int,int > > a(n); vector<int > c(m); for (int i = 0; i < n; ++i) { cin >> a[i].first >> a[i].second; } for (int i = 0; i < m; ++i) { cin >> c[i]; } sort(c.begin(),c.end()); sort(a.begin(),a.end(),[] (const pii& a, const pii& b) { if (a.second != b.second) return a.second < b.second; return a.first < b.first; }); int res = 0; for (int i = 0; i < n && res < m;++i) { if (c[res] >= a[i].first) ++res; } cout << res; } } signed main() { #define name "task" if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> m; subtask3::solve(); cerr << "Time Elasped: " << fixed << setprecision(3) << 1.0*clock()/CLOCKS_PER_SEC << '\n'; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 344 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 344 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Incorrect | 0 ms | 344 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |