<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=%EF%BC%BBLovely%EF%BC%BDboy%EF%BC%BE_%EF%BC%BE%2FUSACO%2FMixingMilk</id>
	<title>［Lovely］boy＾ ＾/USACO/MixingMilk - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://mediawiki.zeropage.org/index.php?action=history&amp;feed=atom&amp;title=%EF%BC%BBLovely%EF%BC%BDboy%EF%BC%BE_%EF%BC%BE%2FUSACO%2FMixingMilk"/>
	<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EF%BC%BBLovely%EF%BC%BDboy%EF%BC%BE_%EF%BC%BE/USACO/MixingMilk&amp;action=history"/>
	<updated>2026-05-16T00:00:56Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.8</generator>
	<entry>
		<id>https://mediawiki.zeropage.org/index.php?title=%EF%BC%BBLovely%EF%BC%BDboy%EF%BC%BE_%EF%BC%BE/USACO/MixingMilk&amp;diff=41477&amp;oldid=prev</id>
		<title>imported&gt;Unknown at 05:28, 7 February 2021</title>
		<link rel="alternate" type="text/html" href="https://mediawiki.zeropage.org/index.php?title=%EF%BC%BBLovely%EF%BC%BDboy%EF%BC%BE_%EF%BC%BE/USACO/MixingMilk&amp;diff=41477&amp;oldid=prev"/>
		<updated>2021-02-07T05:28:37Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;* 이제 assert문 쓰는 법을 알아 가고 있다.&lt;br /&gt;
* 훌륭한 프로그래머들의 습관을 따라 해보려 노력중이다.&lt;br /&gt;
* 전문 프로그래머들은 assert문을 자주 쓴다고 한다.&lt;br /&gt;
&lt;br /&gt;
 #include &amp;amp;lt;iostream&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;fstream&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;map&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;vector&amp;amp;gt;&lt;br /&gt;
 #include &amp;amp;lt;algorithm&amp;amp;gt;&lt;br /&gt;
 using namespace std;&lt;br /&gt;
 &lt;br /&gt;
 ifstream fin(&amp;quot;milk.in&amp;quot;);&lt;br /&gt;
 ofstream fout(&amp;quot;milk.out&amp;quot;);&lt;br /&gt;
 &lt;br /&gt;
 void InputInitData(int&amp;amp;amp; suf, int&amp;amp;amp; numf, map&amp;amp;lt;int,int&amp;amp;gt;&amp;amp;amp; data, vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; numlist);&lt;br /&gt;
 int Process(int&amp;amp;amp; suf, int&amp;amp;amp; numf, map&amp;amp;lt;int,int&amp;amp;gt;&amp;amp;amp; data, vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; numlist);&lt;br /&gt;
 void OutputData(int&amp;amp;amp; numf, map&amp;amp;lt;int,int&amp;amp;gt;&amp;amp;amp; data, vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; numlist);&lt;br /&gt;
 &lt;br /&gt;
 int main()&lt;br /&gt;
 {&lt;br /&gt;
 	int numf, suf;&lt;br /&gt;
 	map&amp;amp;lt;int,int&amp;amp;gt; data;&lt;br /&gt;
 	vector&amp;amp;lt;int&amp;amp;gt; numlist;&lt;br /&gt;
 	InputInitData(suf, numf, data, numlist);&lt;br /&gt;
 &lt;br /&gt;
 	fout &amp;amp;lt;&amp;amp;lt; Process(suf, numf, data, numlist) &amp;amp;lt;&amp;amp;lt; endl;&lt;br /&gt;
 &lt;br /&gt;
 	return 0;&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 void InputInitData(int&amp;amp;amp; suf, int&amp;amp;amp; numf, map&amp;amp;lt;int,int&amp;amp;gt;&amp;amp;amp; data, vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; numlist)&lt;br /&gt;
 {&lt;br /&gt;
 	fin &amp;amp;gt;&amp;amp;gt; suf;&lt;br /&gt;
 	fin &amp;amp;gt;&amp;amp;gt; numf;&lt;br /&gt;
 &lt;br /&gt;
 	int cost, amount;	&lt;br /&gt;
 	for(int i = 0 ; i &amp;amp;lt; numf ; ++i)&lt;br /&gt;
 	{&lt;br /&gt;
 		fin &amp;amp;gt;&amp;amp;gt; cost;&lt;br /&gt;
 		fin &amp;amp;gt;&amp;amp;gt; amount;&lt;br /&gt;
 		if(data[cost] == 0)&lt;br /&gt;
 			numlist.push_back(cost);&lt;br /&gt;
 &lt;br /&gt;
 		data[cost] += amount;&lt;br /&gt;
 	}&lt;br /&gt;
 	sort(numlist.begin(), numlist.end());&lt;br /&gt;
 }&lt;br /&gt;
 &lt;br /&gt;
 int Process(int&amp;amp;amp; suf, int&amp;amp;amp; numf, map&amp;amp;lt;int,int&amp;amp;gt;&amp;amp;amp; data, vector&amp;amp;lt;int&amp;amp;gt;&amp;amp;amp; numlist)&lt;br /&gt;
 {&lt;br /&gt;
 	int ret = 0;&lt;br /&gt;
 	int until = 0;&lt;br /&gt;
 	int whenstop = 0;&lt;br /&gt;
 	for(int i = 0 ; i &amp;amp;lt; numlist.size() ; ++i)&lt;br /&gt;
 	{&lt;br /&gt;
 		if(suf &amp;amp;gt; until + data[numlist[i]])&lt;br /&gt;
 		{			&lt;br /&gt;
 			ret += numlist[i] * data[numlist[i]];&lt;br /&gt;
 			until += data[numlist[i]];&lt;br /&gt;
 		}&lt;br /&gt;
 		else&lt;br /&gt;
 		{&lt;br /&gt;
 			whenstop = i;&lt;br /&gt;
 			break;&lt;br /&gt;
 		}&lt;br /&gt;
 	}&lt;br /&gt;
 &lt;br /&gt;
 	if(whenstop &amp;amp;lt;  numlist.size())&lt;br /&gt;
 		ret += numlist[whenstop] * (suf - until);&lt;br /&gt;
 	return ret;&lt;br /&gt;
 }&lt;br /&gt;
&lt;/div&gt;</summary>
		<author><name>imported&gt;Unknown</name></author>
	</entry>
</feed>