# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1172754 | Tsagana | Exhibition (JOI19_ho_t2) | C++17 | 96 ms | 1588 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<array<int, 2> > v(n);
vector<int> c(m);
for(auto &x : v) cin >> x[1] >> x[0];
for(int &x : c) cin >> x;
sort(v.rbegin(), v.rend());
sort(c.rbegin(), c.rend());
int j = 0;
for(int i=0; i<n; i++)
if(v[i][1] <= c[j]) j++;
cout << j << '\n';
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... |