# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
788214 | makanhulia | Exhibition (JOI19_ho_t2) | C++17 | 1 ms | 212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ioss ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
int n, m;
vector<pii> gambar;
bool comp(pii a, pii b) {
return (a.se < b.se || (a.se == b.se && a.fi < b.fi));
}
signed main() {
ioss;
cin >> n >> m;
for(int i = 0; i < n; i++) {
int s, v; cin >> s >> v;
gambar.pb({s, v});
}
sort(gambar.begin(), gambar.end(), comp);
vector<int> bingkai;
for(int i = 0; i < m; i++) {
int x; cin >> x;
bingkai.pb(x);
}
int tmp = 0;
vector<int> ans;
for(int i = 0; i < m; i++) {
auto [s, v] = gambar[tmp];
auto size = bingkai[i];
if(s <= size) ans.pb(tmp), tmp++;
if(tmp == gambar.size()) break;
// cout << " :: " << s << " " << size << " " << ans << endl;
}
cout << ans.size() << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |