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 size second
#define value first
int N, M;
pair<int,int> picture[100100];
int frame[100100];
int ans;
int main() {
cin >> N >> M;
for(int i=1; i<=N; i++) {
cin >> picture[i].size >> picture[i].value;
}
sort(picture+1, picture+N+1);
for(int i=1; i<=M; i++) {
cin >> frame[i];
}
sort(frame+1, frame+M+1);
int i=N;
int j=M;
while(i>=1 && j>=1) {
if (picture[i].size <= frame[j]) {
ans++;
i--;
j--;
} else {
i--;
}
}
cout << ans << endl;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |