# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
745288 | 2023-05-19T18:50:38 Z | HoriaHaivas | Exhibition (JOI19_ho_t2) | C++14 | 1 ms | 212 KB |
/* "TLE is like the wind, always by my side" - Yasuo - 2022 - */ #include <bits/stdc++.h> #define debug(x) cerr << #x << " " << x << "\n" #define debugs(x) cerr << #x << " " << x << " " #pragma GCC optimize("Ofast") using namespace std; struct painting { int s; int v; }; painting a[100001]; int sz[100001]; bool cmp(painting aa, painting bb) { if (aa.v!=bb.v) return aa.v<bb.v; else return aa.s>bb.s; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n,m,i,j,k; cin >> n >> m; for (i=1;i<=n;i++) { cin >> a[i].s >> a[i].v; } for (i=1;i<=m;i++) { cin >> sz[i]; } sort(sz+1,sz+1+m); sort(a+1,a+1+n,cmp); k=0; for (i=n;i>=1;i--) { if (sz[m-k]>=a[i].s && m-k>=1) k++; } cout << k; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Incorrect | 1 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |