# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1014557 | Error404 | Kitchen (BOI19_kitchen) | C++17 | 1 ms | 2652 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.
#include "bits/stdc++.h"
using namespace std;
#define ll long long
#define f first
#define s second
#define pi pair<ll,ll>
#define vi vector<ll>
#define vd vector<double>
#define vpi vector<pi>
#define pb push_back
#define INF 1e18
#define endl '\n'
//#define int ll
#define pii pair<pi,ll>
const int mod = 1e9+7;
const int MAX = 1e5+1;
const int LOG = 30;
vi g[MAX];
int tin[MAX], val[MAX], tout[MAX];
int up[LOG+1][MAX];
map<pi,int>mp;
vector<pi>order;
int timer = 0;
signed main(){
int n,m,k,a,b;
cin >>n >> m >> k;
int dish[n+1], chef[m+1];
for(int i= 1; i<= n; i++){
cin >> dish[i];
}
multiset<int>st;
for(int i = 1; i <=m; i++){
cin >> chef[i];
st.insert(chef[i]);
}
ll ans = 0;
bool flag = false;
for(int i = n; i >=1; i--){
auto j = st.lower_bound(dish[i]);
if(j==st.end()) {
cout << "Impossible"<<endl;
return 0;
}
ans += (*j)-dish[i];
st.insert((*j)-dish[i]);
// st.erase(j);
}
cout << ans << endl;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |