Submission #744611

#TimeUsernameProblemLanguageResultExecution timeMemory
744611HoriaHaivasExhibition (JOI19_ho_t2)C++14
0 / 100
0 ms340 KiB
/* "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]; int n,m,i,j,k; bool cmp(painting aa, painting bb) { if (aa.s!=bb.s) return aa.s<bb.s; else return aa.v>bb.v; } int main() { ifstream fin("secvp.in"); ofstream fout("secvp.out"); ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); 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; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...