# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120139 | antimirage | Exhibition (JOI19_ho_t2) | C++14 | 124 ms | 6108 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.
/**
GOT A FEELING THAT I"M GOING UNDER
**/
#include <bits/stdc++.h>
#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define all(s) s.begin(), s.end()
using namespace std;
const int N = 1e5 + 5;
int n, m, x, y, c[N], ans, last = 1e9 + 7;
multiset < pair <int, int>, greater < pair <int, int> > > st;
main(){
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("%d%d", &x, &y);
st.insert( mk( y, x ) );
}
for (int i = 1; i <= m; i++) {
scanf("%d", &c[i]);
}
sort(c + 1, c + m + 1);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |