# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305827 | 2020-09-24T02:15:21 Z | T0p_ | Exhibition (JOI19_ho_t2) | C++14 | 1 ms | 384 KB |
#include<bits/stdc++.h> using namespace std; struct picture { int s, v; bool operator < (const picture & o) const { return v < o.v; } }; picture p[100100]; int f[100100], arr[100100]; int main() { int n, m; scanf(" %d %d",&n,&m); for(int i=1 ; i<=n ; i++) scanf(" %d %d",&p[i].s,&p[i].v); for(int i=1 ; i<=m ; i++) scanf(" %d",&f[i]); sort(p+1, p+n+1); sort(f+1, f+m+1); int j = m, ans = 0; for(int i=n ; i>=1 && j >= 1; i--) { if(p[i].s <= f[j]) { j--; ans++; } } printf("%d\n",ans); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Incorrect | 1 ms | 384 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |