# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
744601 | 2023-05-18T19:16:38 Z | HoriaHaivas | Exhibition (JOI19_ho_t2) | C++14 | 0 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[200001]; int sz[200001]; bool cmp(painting aa, painting bb) { return aa.v>bb.v; } 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 && m>0;i--) { if (sz[m]>=a[i].s) { k++; m--; } } cout << k; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |