/*
#include <stdio.h>
#include <stdbool.h>
#include <stdlib.h>
#define PL 5
int* solution(int prices[], size_t prices_len) {
int* answer = (int*)malloc(sizeof(int)*prices_len); // answer 배열, sizeof int 해주고 prices의 길이만큼 곱하기(배열 길이 설정).
//answer[2]=1; 가능
}
*/
//////////////그리디//////
/*
3301-거스름돈.
#include <stdio.h>
int main()
{
int n, cnt=0, i;
int m[8]={50000,10000,5000,1000,500,100,50,10}; // 배열로 저장.
scanf("%d", &n);
for(i=0;i<8;i++)
{
cnt+=n/m[i];
n=n%m[i];
}
printf("%d", cnt);
}
*/
/////CPP/////////
/*
--> 노트 참고.
#include <stdio.h>
#include <vector>
using namespace std;
vector<int> solution(vector<int> array, vector<vector<int>> commands) // 1차원배열, 2차원배열.
{
vector<int> answer;
array.push_back(1);
array.at(1)=18;
array{1}=18;
int n=array.at(1);
int m=array[1];
int num=array.size();
array.erase(array.begin());
return answer;
}
*/