| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 306161 | sofapuden | Exhibition (JOI19_ho_t2) | C++14 | 270 ms | 1784 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;
int main(){
ll n, m; cin >> n >> m;
vector<int> x(m);
vector<pair<int,int>> v(n);
for(auto &i : v)cin >> i.second >> i.first;
for(auto &i : x)cin >> i;
sort(v.rbegin(),v.rend());
sort(x.rbegin(),x.rend());
int c = 0; int ans = 0;
for(int i = 0; i < m; ++i){
while(c != n && v[c].second > x[i])c++;
if(c!=n){
c++;
ans++;
}
}
cout << ans << "\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
