void InsertionSort(int A[], int N){
    int j ,p;
    int Tmp;
    for(p=1;p<N;p++){
        Tmp = A[p];
        for(j=p;j>0&&A[j-1]>Tmp;j--)
            A[j]=A[j-1];
        A[j]=Tmp;
     }
}

void ShellSort(int a[], int n){
    int i,j,increment;
    int tmp;
    for(increment = n/2;increment>0;increment/=2)
        for(i=increment;i<n;i++){
           tmp = a[i];
           for(j=i;j>=increment;j-=increment){
              if(tmp<a[j-increment])
                 a[j]=a[j-increment];
              else
                 break;
           } 
           a[j]=tmp;
        }
}

void precDown(int a[],int i ,int n){
    int child;
    int tmp;
    for(tmp=a[i];leftchild(i)<n;i=child){
        child = leftchild(i);
        if(child!=n-1&&a[child+1]>a[child])
            child++;
        if(tmp<a[child])
            a[i]=a[child];
        else
            break;
    }
    a[i]=tmp;
}
void swap(int *a, int *b){
    int temp = *a;
    *a = *b;
    *b= temp;
}
void heapSort(int a[],int n){
    int i;
    for(i=n/2;i>=0;i--)
        precDown(a,i,n);
    for(i=n-1;i>0;i--){
        swap(&a[0],&a[i]);
        precDown(a,0,i);
    }
}

void merge(int a[],int tmpArray[],int lpos,int rpos,int rightEnd){
    int i,leftEnd,numelements,tmpPos;
    
    leftEnd = rpos - 1;
    tmpPos = lpos;
    numelements = rightEnd-lpos+1;

    while(lpos<=leftEnd&&rpos<=rightEnd)
        if(a[lpos]<=a[rpos])
            tmpArray[tmpPos++]=a[lpos++];
        else
            tmpArray[tmpPos++]=a[rpos++];

    while(lpos<=leftEnd)
        tmpArray[tmpPos++]=a[lpos++];

    while(rpos<=rightEnd)
        tmpArray[tmpPos++]=a[rpos++];

    for(i=0;i<numelements;i++,rightEnd--)
        a[rightEnd]=tmpArray[rightEnd];
}

void Msort(int a[],int tmpArray[],int left,int right){
    int center;
    if(left<right){
        center=(left+right)/2;
        Msort(a,tmpArray,left,center);
        Msort(a,tmpArray,center+1,right);
        merge(a,tmpArray,left,center+1,right);
    }
}

void mergeSort(int a[],int n){
    int *tmpArray;
    tmpArray=malloc(n*sizeof(int));
    if(tmpArray!=NULL){
        Msort(a,tmpArray,0,n-1);
        free(tmpArray);
    }
}

def quickSort(arr):
    length = len(arr)
    if length <= 1:
        return arr
    else:
        index = length / 2
        left = []
        right = []
        for i in range(0,length):
            if i == index:
                continue
            if arr[i] < arr[index]:
                left.append(arr[i])
            else:
                right.append(arr[i])
        return quickSort(left)+[arr[index]]+quickSort(right)

void swap(int *a,int *b){
    int temp = *a;
    *a = *b;
    *b = temp;
}

int median3(int a[],int left ,int right){
    int center = (left+right)/2;
    if(a[left]>a[center])
        swap(&a[left],&a[center]);
    if(a[left]>a[right])
        swap(&a[left],&a[right]);
    if(a[center]>a[right])
        swap(&a[center],&a[right]);

    swap(&a[center],&a[right-1]);
    return a[right-1];
}

void qsort(int a[],int left, int right){
    int i,j;
    int pivot;

    if(left+cutoff<=right){
        pivot=median3(a,left,right);
        i=left;j=right-1;
        for(;;){
            while(a[++i]<pivot){}
            while(a[--j]>pivot){}
            if(i<j)
                swap(&a[i],&a[j]);
            else
                break;
        }
        swap(&a[i],&a[right-1]);
        qsort(a,left,i-1);
        qsort(a,i+1,right);
    }else
        insertionSort(a,right-left+1);    
}
void quickSort(int a[],int n){
    qsort(a,0,n-1);
}

window.code=xxx;

xxx:
	408 登陆超时
	201 扫描成功
	200 确认登录

当带有loginicon时扫码就会返回头像

当返回200时，还会有
window.redirect_uri="https://wx.qq.com/cgi-bin/mmwebwx-bin/webwxnewloginpage?ticket=xxx&uuid=xxx&lang=xxx&scan=xxx";

<error>
	<ret>0</ret>
	<message>OK</message>
	<skey>xxx</skey>
	<wxsid>xxx</wxsid>
	<wxuin>xxx</wxuin>
	<pass_ticket>xxx</pass_ticket>
	<isgrayscale>1</isgrayscale>
</error>

{
	"BaseResponse": {
		"Ret": 0,
		"ErrMsg": ""
	},
	"Count": 11,
	"ContactList": [...],
	"SyncKey": {
		"Count": 4,
		"List": [
			{
				"Key": 1,
				"Val": 635705559
			},
			...
		]
	},
	"User": {
		"Uin": xxx,
		"UserName": xxx,
		"NickName": xxx,
		"HeadImgUrl": xxx,
		"RemarkName": "",
		"PYInitial": "",
		"PYQuanPin": "",
		"RemarkPYInitial": "",
		"RemarkPYQuanPin": "",
		"HideInputBarFlag": 0,
		"StarFriend": 0,
		"Sex": 1,
		"Signature": "Apt-get install B",
		"AppAccountFlag": 0,
		"VerifyFlag": 0,
		"ContactFlag": 0,
		"WebWxPluginSwitch": 0,
		"HeadImgFlag": 1,
		"SnsFlag": 17
	},
	"ChatSet": xxx,
	"SKey": xxx,
	"ClientVersion": 369297683,
	"SystemTime": 1453124908,
	"GrayScale": 1,
	"InviteStartCount": 40,
	"MPSubscribeMsgCount": 2,
	"MPSubscribeMsgList": [...],
	"ClickReportInterval": 600000
}

{
	"BaseResponse": {
		"Ret": 0,
		"ErrMsg": ""
	},
	...
}

{
	"BaseResponse": {
		"Ret": 0,
		"ErrMsg": ""
	},
	"MemberCount": 334,
	"MemberList": [
		{
			"Uin": 0,
			"UserName": xxx,
			"NickName": "Urinx",
			"HeadImgUrl": xxx,
			"ContactFlag": 3,
			"MemberCount": 0,
			"MemberList": [],
			"RemarkName": "",
			"HideInputBarFlag": 0,
			"Sex": 0,
			"Signature": "你好，我们是地球三体组织。在这里，你将感受到不一样的思维模式，以及颠覆常规的世界观。而我们的目标，就是以三体人的智慧，引领人类未来科学技术500年。",
			"VerifyFlag": 8,
			"OwnerUin": 0,
			"PYInitial": "URINX",
			"PYQuanPin": "Urinx",
			"RemarkPYInitial": "",
			"RemarkPYQuanPin": "",
			"StarFriend": 0,
			"AppAccountFlag": 0,
			"Statues": 0,
			"AttrStatus": 0,
			"Province": "",
			"City": "",
			"Alias": "Urinxs",
			"SnsFlag": 0,
			"UniFriend": 0,
			"DisplayName": "",
			"ChatRoomId": 0,
			"KeyWord": "gh_",
			"EncryChatRoomId": ""
		},
		...
	],
	"Seq": 0
}

window.synccheck={retcode:"xxx",selector:"xxx"}

retcode:
	0 正常
	1100 失败/登出微信
selector:
	0 正常
	2 新的消息
	7 进入/离开聊天界面

{
	'BaseResponse': {'ErrMsg': '', 'Ret': 0},
	'SyncKey': {
		'Count': 7,
		'List': [
			{'Val': 636214192, 'Key': 1},
			...
		]
	},
	'ContinueFlag': 0,
	'AddMsgCount': 1,
	'AddMsgList': [
		{
			'FromUserName': '',
			'PlayLength': 0,
			'RecommendInfo': {...},
			'Content': "", 
			'StatusNotifyUserName': '',
			'StatusNotifyCode': 5,
			'Status': 3,
			'VoiceLength': 0,
			'ToUserName': '',
			'ForwardFlag': 0,
			'AppMsgType': 0,
			'AppInfo': {'Type': 0, 'AppID': ''},
			'Url': '',
			'ImgStatus': 1,
			'MsgType': 51,
			'ImgHeight': 0,
			'MediaId': '', 
			'FileName': '',
			'FileSize': '',
			...
		},
		...
	],
	'ModChatRoomMemberCount': 0,
	'ModContactList': [],
	'DelContactList': [],
	'ModChatRoomMemberList': [],
	'DelContactCount': 0,
	...
}

{
	"BaseResponse": {
		"Ret": 0,
		"ErrMsg": ""
	},
	...
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define MAX_LEN 100
enum type_token {IDENTIFIER,QUALIFIER,TYPE};
typedef struct token{
    char string[100];
    char type;
}token;
token tmp_token;
typedef struct stack{
    token array[MAX_LEN];
    int top;
}stack;
struct stack token_stack;
void init(stack *sta)
{
    sta->top=-1;
}
int push(stack *sta,token s)
{
    if(sta->top>=254)
    {
        printf("the stack is full.\n");
        return 1;
    }
    else
    {
        sta->array[++(sta->top)]=s;
    }
    return 0;
}
token pop(stack *sta)
{
    
        return sta->array[(sta->top)--];
    
    
}
int stack_empty(const stack s)
{
    if(s.top==-1)
        return 0;
    else
        return 1;
}
token top_stack(const stack s)
{

        return s.array[s.top];
}
enum type_token classify_string(void);
void gettoken()
{//读取token函数，如果是字母，数字，下划线就一直读取，否则就停止存入tmp_token中处理
    memset(tmp_token.string,'\0',sizeof(tmp_token.string));//先把tmp_token清空
    char *p=tmp_token.string;
    while((*p=getchar())==' ');//略过空白字符
    if(isalnum(*p) || *p=='_'){
        //读入的标志符要是字母，数字或者下划线，表示是标志符
        while(1)
        {
            *(++p)=getchar();
            if(isalnum(*p) || *p=='_')
                continue;
            else
                break;
        }
        ungetc(*p,stdin);//把非满足的字符放回缓冲区，下次再用
        *p='\0';
        tmp_token.type=classify_string();
        return;
    }
    if(*p=='*'){
        strcpy(tmp_token.string,"pointer to ");
        tmp_token.type='*';
        return;
    }
    tmp_token.string[1]='\0';
    tmp_token.type=*p;
    return;
}
enum type_token classify_string()
{//推断标志符的类型
    char *s=tmp_token.string;
    if(!strcmp(s,"const")){
        strcpy(s,"read-only ");
        return QUALIFIER;
    }
    if(!strcmp(s,"volatile")) return QUALIFIER;
    if(!strcmp(s,"extern")) return QUALIFIER;
    if(!strcmp(s,"void")) return TYPE;
    if(!strcmp(s,"char")) return TYPE;
    if(!strcmp(s,"signed")) return TYPE;
    if(!strcmp(s,"unsigned")) return TYPE;
    if(!strcmp(s,"short")) return TYPE;
    if(!strcmp(s,"int")) return TYPE;
    if(!strcmp(s,"long")) return TYPE;
    if(!strcmp(s,"float")) return TYPE;
    if(!strcmp(s,"double")) return TYPE;
    if(!strcmp(s,"struct")) return TYPE;
    if(!strcmp(s,"union")) return TYPE;
    if(!strcmp(s,"enum")) return TYPE;
    return IDENTIFIER;
}
void read_first_identifier(){
    gettoken();
    while(tmp_token.type!=IDENTIFIER){
        push(&token_stack,tmp_token);
        gettoken();
    }
    printf("%s is ",tmp_token.string);
    gettoken();
}
void deal_with_array()
{
    while(tmp_token.type=='[')
    {
        printf("array");
        gettoken();
        if(isdigit(tmp_token.string[0]))
        {
            printf(" 0..%d ",atoi(tmp_token.string)-1);
            gettoken();
        }
        gettoken();//读取‘】’之后的token
        printf("of ");
    }
}
void deal_with_function()
{
    while(tmp_token.type != ')')
        gettoken();
    gettoken();
    printf(" function returning ");
}
void deal_with_pointer()
{
    token t;
    t=top_stack(token_stack);
    while(t.type=='*')
    {
        printf("%s",t.string);
        pop(&token_stack);
        t=top_stack(token_stack);
    }
}
void deal_with_declarator(){//递归处理的过程
    switch(tmp_token.type){
        case '[': deal_with_array();break;
        case '(': deal_with_function();
    }
    deal_with_pointer();
    while(stack_empty(token_stack)==1)
    {
        token t=top_stack(token_stack);
        if(t.type=='('){
            pop(&token_stack);
            gettoken();//读取‘）’之后的符号
            deal_with_declarator();
        }
        else
        {
            printf("%s",pop(&token_stack).string);
        }
    }
}



int main()
{
    init(&token_stack);
    read_first_identifier();
    deal_with_declarator();
    printf("\n");
    return 0;
}

sslocal -c json
sudo polipo socksParentProxy=localhost:1080 proxyPort=1087
request(proxy={}) # 具体看代码

function calc(arr,num_list){
	if(arr.length<=1) {
		num_list.push(arr[0])
		let str = num_list.join('')
		return eval(str)
	}
	else{
		let num = arr.shift()
		num_list.push(num)
		if(num_list.length===3){
			let str = num_list.join('')
			num_list=[eval(str)]
		}
		return calc(arr,num_list)
	}
}

#include <stdio.h>  

int n = 0;  

void swap(int *a, int *b) 
{     
    int m;     
    m = *a;     
    *a = *b;     
    *b = m; 
}  
void perm(int list[], int k, int m) 
{     
    int i;     
    if(k > m)     
    {          
        for(i = 0; i <= m; i++)             
            printf("%d ", list[i]);         
        printf("\n");         
        n++;     
    }     
    else     
    {         
        for(i = k; i <= m; i++)         
        {             
            swap(&list[k], &list[i]);             
            perm(list, k + 1, m);             
            swap(&list[k], &list[i]);         
        }     
    } 
} 
int main() 
{     
    int list[] = {1, 2, 3, 4, 5};     
    perm(list, 0, 4);     
    printf("total:%d\n", n);     
    return 0; 
}  

var webpack = require('webpack');
var path = require('path');

module.exports = function() {
    return {
        entry: {
            main: './index.js' //Notice that we do not have an explicit vendor entry here
        },
        output: {
            filename: '[name].[chunkhash].js',
            path: path.resolve(__dirname, 'dist')
        },
        plugins: [
            new webpack.optimize.CommonsChunkPlugin({
                name: 'vendor',
                minChunks: function (module) {
                   // this assumes your vendor imports exist in the node_modules directory
                   return module.context && module.context.indexOf('node_modules') !== -1;
                }
            }),
            //CommonChunksPlugin will now extract all the common modules from vendor and main bundles
            new webpack.optimize.CommonsChunkPlugin({
                name: 'manifest' //But since there are no more common modules between them we end up with just the runtime code included in the manifest file
            })
        ]
    };
}

var HtmlWebpackPlugin = require('html-webpack-plugin');

var webpackConfig = {
  entry: 'index.js',
  output: {
    path: 'dist',
    filename: 'index_bundle.js'
  },
  plugins: [new HtmlWebpackPlugin()]
};

new WebpackDevServer(webpack(config), {
  publicPath: config.output.publicPath,
  hot: true,
  historyApiFallback: {
    rewrites: [
      { from: /^\/$/, to: '/index.html' },
    ],
  },
  proxy: {
    '/api': {
      target: 'http://localhost:8000/api/',
      pathRewrite: {'^/api' : ''},
      secure: false,
    },
  },
  setup: function (app) {
    // app.get('/some/path', function (req, res) {
    //  you can set mock there,
    // });
  },
}).listen(3000, 'localhost', function (err, result) {
  if (err) {
    return console.log(err)
  }

  opn('http://localhost:3000/');

  console.log('Listening at http://localhost:3000/')
});

[program:song] ;
;directory = /home/ubuntu/songSpider;
command = python3 /home/ubuntu/songSpider/getPlayList.py ;
startsecs = 10        ;
redirect_stderr = true  ;
autorestart = true   ;
stdout_logfile_maxbytes = 50MB  ;
stdout_logfile = /home/ubuntu/super_song.log
[supervisorctl]
serverurl=unix:///tmp/supervisor.sock ; use a unix:// URL  for a unix socket

db.createUser({user: "simpleUser",pwd: "simplePass",roles: ["root" ]})
mongo --port 27017 -u "adminUser" -p "adminPass" --authenticationDatabase "admin"
mongod --auth --port 27017 --dbpath /data/db1

pkill mongod

import pymongo
connection = pymongo.MongoClient('mongodb://xxx:pwd@localhost:27017/')
print('连接成功')
# user_info_db = connection.user_info
db = connection.song
user_info_coll = db.user_info
songs_coll = db['songlist' + songlistID]

{
    "address": "$input.params('address')",
    "content": "$input.params('content')",
    "title": "$input.params('title')"
}

 def camelMatch(self, qs, p):
        def u(s):
            return [c for c in s if c.isupper()]

        def issup(s, t):
            it = iter(t)
            return all(c in it for c in s)
        return [u(p) == u(q) and issup(p, q) for q in qs]

 longest = collections.defaultdict(lambda: 2)
# dict's key can be tupe

def largestDivisibleSubset(self, nums):
    S = {-1: set()}
    for x in sorted(nums):
        S[x] = max((S[d] for d in S if x % d == 0), key=len) | {x}
    return list(max(S.values(), key=len))

dp[i+1][j+1] = dp[i+1][j] + dp[i][j+1] + matrix[i][j] - dp[i][j]

class Solution:
    def nthUglyNumber(self, n: int) -> int:
        k = [1] *n
        
        t2,t3,t5 = 0,0,0
        
        for i in range(1,n):
            k[i] = min(k[t2]*2, k[t3]*3, k[t5]*5)
             
            if k[i] == k[t2] * 2:
                t2+=1
            if k[i] == k[t3] * 3:
                t3+=1
            if k[i] == k[t5] * 5:
                t5+=1
            
        return k[-1]

from functools import lru_cache
class Solution:
    def findSubstringInWraproundString(self, p: str) -> int:
        res = {i: 1  for i in p}
        
        l = 1
        
        for i,j in zip(p,p[1:]):
            l = l + 1 if (ord(j) - ord(i))%26 == 1 else 1
            
            res[j] = max(res[j], l)
            
        return sum(res.values())
    
    
    # 想清楚 dp的状态是哪一个 这题是以什么字母为结尾
    # 最优子结构之间的关系这种
    # 只要得到最大的去重这步自然就解决了，因为对于相同字母结尾有相同顺序的一定有一样的结构按顺序的精妙！

char *p = "abcdefgh";
c = p[i]

编译器具有一个p 地址为4624
运行时取4624的内容 5081
取得i的值与5081相加
取地址[5081+i]的内容

function map(String name, String document):
  // name: document name
  // document: document contents
  for each word w in document:
    emit (w, 1)

function reduce(String word, Iterator partialCounts):
  // word: a word
  // partialCounts: a list of aggregated partial counts
  sum = 0
  for each pc in partialCounts:
    sum += pc
  emit (word, sum)
  //from wikipedia

P.contextTypes = {
  color: PropTypes.string
}

setImmediate(function(){
    console.log(1);
},0);
setTimeout(function(){
    console.log(2);
},0);
new Promise(function(resolve){
    console.log(3);
    resolve();
    console.log(4);
}).then(function(){
    console.log(5);
});
console.log(6);
process.nextTick(function(){
    console.log(7);
});
console.log(8);

macrotasks: script(整体代码),setTimeout, setInterval, setImmediate, I/O, UI rendering
microtasks: process.nextTick, Promises, Object.observe, MutationObserver

// timeout_vs_immediate.js
setTimeout(function timeout () {
  console.log('timeout');
},0);

setImmediate(function immediate () {
  console.log('immediate');
});

$ node timeout_vs_immediate.js
timeout
immediate

$ node timeout_vs_immediate.js
immediate
timeout

// timeout_vs_immediate.js
var fs = require('fs')

fs.readFile(__filename, () => {
  setTimeout(() => {
    console.log('timeout')
  }, 0)
  setImmediate(() => {
    console.log('immediate')
  })
})

$ node timeout_vs_immediate.js
immediate
timeout

$ node timeout_vs_immediate.js
immediate
timeout

const EventEmitter = require('events');
const util = require('util');

function MyEmitter() {
  EventEmitter.call(this);
  this.emit('event');
}
util.inherits(MyEmitter, EventEmitter);

const myEmitter = new MyEmitter();
myEmitter.on('event', function() {
  console.log('an event occurred!');
});

const EventEmitter = require('events');
const util = require('util');

function MyEmitter() {
  EventEmitter.call(this);

  // use nextTick to emit the event once a handler is assigned
  process.nextTick(function () {
    this.emit('event');
  }.bind(this));
}
util.inherits(MyEmitter, EventEmitter);

const myEmitter = new MyEmitter();
myEmitter.on('event', function() {
  console.log('an event occurred!');
});

var server = net.createServer();
server.on('connection', function(conn) { });

server.listen(8080);
server.on('listening', function() { });

// this has an asynchronous signature, but calls callback synchronously
function someAsyncApiCall (callback) { callback(); };

// the callback is called before `someAsyncApiCall` completes.
someAsyncApiCall(() => {

  // since someAsyncApiCall has completed, bar hasn't been assigned any value
  console.log('bar', bar); // undefined

});

var bar = 1;

function someAsyncApiCall (callback) {
  process.nextTick(callback);
};

someAsyncApiCall(() => {
  console.log('bar', bar); // 1
});

var bar = 1;

for(int i = 1; i <= n; i++)  
    {  
        for(int j = 0; j <= W; j++)  
        {  
            if(j < w[i])    dp[i][j]  = dp[i-1][j];  
            else 
                dp[i][j] =  max(dp[i-1][j], dp[i-1][j - w[i]] + v[i]);  
        }  
    } 

int f[w+1];     
for (int i=0; i<n; i++)  
    for (int j=w; j>=size[i]; j--)  
        f[j] = max(f[j], f[j-size[i]]+value[i]);  

int w[] = {1,4,1,1};
int v[] = {2,3,4,6};
// 总容量 4

w:4 3 2 1
  2 2 2 2
  3
  6 6 6 4
  12 12 10 6

for (int i=0; i<n; i++)  
    for (int j=size[i]; j<=w; j++)  
        f[j] = max(f[j], f[j-size[i]]+value[i]); 

#include<iostream>  
#include<cstdio>  
#include<cstring>  
using namespace std;  
  
int Value[105];  
int Cost[105];  
int Bag[105];  
int dp[105];  
  
int main()  
{  
    int C,m,n;  
    scanf("%d",&C);  
    while(C--)  
    {  
        scanf("%d%d",&n,&m);  
        for(int i = 1; i <= m; i++)  
            scanf("%d%d%d",&Cost[i],&Value[i],&Bag[i]);  
        memset(dp,0,sizeof(dp));  
        for(int i=1; i<= m; i++)  
            for(int j=1; j<=Bag[i]; j++)  
                for(int k=n; k>=Cost[i]; k--)  
                    dp[k]=max(dp[k], dp[k-Cost[i]]+Value[i]);  
        printf("%d\n",dp[n]);  
    }  
    return 0;  
}  

#include <iostream>  
using namespace std;  
int main()  
{  
    int nCase,Limit,nKind,i,j,k,  v[111],w[111],c[111],dp[111];  
    //v[]存价值，w[]存尺寸，c[]存件数  
    //在本题中，价值是米的重量，尺寸是米的价格  
    int count,Value[1111],size[1111];  
    //count存储分解完后的物品总数  
    //Value存储分解完后每件物品的价值  
    //size存储分解完后每件物品的尺寸  
    cin>>nCase;  
    while(nCase--)  
    {  
        count=0;  
        cin>>Limit>>nKind;  
        for(i=0; i<nKind; i++)  
        {  
            cin>>w[i]>>v[i]>>c[i];  
            //对该种类的c[i]件物品进行二进制分解  
            for(j=1; j<=c[i]; j<<=1)  
            {  
                //<<左移1位，相当于乘2  
                Value[count]=j*v[i];  
                size[count++]=j*w[i];  
                c[i]-=j;  
            }  
            if(c[i]>0)  
            {  
                Value[count]=c[i]*v[i];  
                size[count++]=c[i]*w[i];  
            }  
        }  
        //经过上面对每一种物品的分解，  
        //现在Value[]存的就是分解后的物品价值  
        //size[]存的就是分解后的物品尺寸  
        //count就相当于原来的n  
        //下面就直接用01背包算法来解  
        memset(dp,0,sizeof(dp));  
        for(i=0; i<count; i++)  
            for(j=Limit; j>=size[i]; j--)  
                if(dp[j]<dp[j-size[i]]+Value[i])  
                    dp[j]=dp[j-size[i]]+Value[i];  
  
        cout<<dp[Limit]<<endl;  
    }  
    return 0;  
}  

def insert(self,element):
    i = self.getSize() + 1
    self.elements.append(None)
    while self.elements[i/2] > element:
        self.elements[i] = self.elements[i/2]
        i/=2
        self.elements[i] = element

def siftdown(self,i):
    elements = self.elements
    tmp=elements[i]
    while(2*i<len(elements)):
        child=2*i
        if child+1 < len(elements):
            if(elements[child+1]<elements[child]):
                child+=1
        if(tmp>elements[child]):
            elements[i]=elements[child]
        else:
            break
        i=child
    elements[i]=tmp
    
def deleteMin(self):
    if self.isEmpty():
        raise Exception('heap is empty')
    temp = self.elements[1]
    self.elements[1]=self.elements[-1]
    self.elements.pop()
    self.siftdown(1)
    return temp

for(i=n/2; i>0; i--)
    PercolateDown(i)