# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150148 | 샌즈뼈 (#200) | 포도주 시음 (FXCUP4_wine) | 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>
#include "bartender.h"
using namespace std;
std::vector<int> BlendWines(int K, std::vector<int> R)
{
int N = R.size();
int i;
int C=6;
vector<int> ret(N);
for (i=0;i<N;i++) ret[i] = max(1,R[i]-C) - 1;
return ret;
}
#include <bits/stdc++.h>
#include "taster.h"
using namespace std;
bool comp(int e1, int e2)
{
if (a[e1]!=a[e2]) return a[e1]<a[e2];
return Compare(e1,e2)==-1;
}
std::vector<int> SortWines(int K, std::vector<int> A)
{
int N = A.size();
vector<int> arr(N), ans(N);
int i;
for (i=0;i<N;i++) a[i]=A[i];
for (i=0;i<N;i++) arr[i]=i;
sort(arr.begin(),arr.end(),comp);
for (i=0;i<N;i++)
ans[arr[i]] = i+1;
return ans;
}