# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
786136 | andecaandeci | 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;
typedef long long ll;
const ll mod = 1e9 + 7;
struct ds{
int si,value;
};
bool comp(ds p1, ds p2) {
return p1.value > p2.value;
}
int hitung(vector<ds>& v, vector<int>& pi) {
sort(v.begin(), v.end(), comp);
int tot = 0;
int i = 0;
for (int j = 0; j < pi.size() && i < v.size(); j++) {
if(pi[j] >= v[i].si) {
tot++;
i++;
}
}
return tot;
}
int main() {
int N, M;
cin >> N >> M;
vector<ds> v(N);
for (int i = 0; i < N; i++) {
cin >> v[i].si >>v[i].value;
}
vector<int> pi(M);
for (int i = 0; i < M; i++) {
cin >> pi[i];
}
int result = hitung(v, pi);
cout << result << 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... |