# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993229 | vjudge1 | Robots (IOI13_robots) | C++17 | 0 ms | 0 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>
#define ll long long
#define endl '\n'
//#define f first
//#define s second
using namespace std;
int putaway(int a , int b , int t , int x[] , int y[] , int w[] , int s[])
{
vector<int> v;
for (int i=0; t>i; i++)
{
v.push_back(w[i]);
}
sort(v.begin() , v.end());
sort(x , x + a);
int ans = 0;
while (!v.empty())
{
bool f = 0;
int j = a - 1;
for (int i=v.size()-1; i>=0; i--)
{
if (x[j] >= v[i])
{
v.pop_back();
f = 1;
}
}
ans++;
if (f == 0)
{
ans = -1;
break;
}
}
return ans;
}
int main ()
{
}
/*
*/