% 
% Global constraint cond_lex_cost in MiniZinc.
% 
% From Global Constraint Catalogue
% http://www.emn.fr/x-info/sdemasse/gccat/sec4.57.html
% """
% cond_lex_cost​(VECTOR,​PREFERENCE_TABLE,​COST)
% 
% Purpose
%
% VECTOR is assigned to the COSTth item of the collection PREFERENCE_TABLE.
% 
% Example
%     (
%     <0, 1>,
%     <
%     tuple-〈1, 0>,
%     tuple-〈0, 1>,
%     tuple-〈0, 0>,
%     tuple-〈1, 1>
%     >, 2
%     )
% 
% The cond_lex_cost constraint holds since VECTOR is assigned to the second item of the 
% collection PREFERENCE_TABLE.
% 
% """

% 
% This MiniZinc model was created by Hakan Kjellerstrand, hakank@bonetmail.com
% See also my MiniZinc page: http://www.hakank.org/minizinc

% include "globals.mzn"; 

int: n = 4;
int: m = 2;
array[1..n, 1..m] of var 0..1: arr;
array[1..m] of var 0..1: v1;
var 1..n: pos;

%
% adding an index parameter: in which position is v?
% This is in effect the same as the global constraint cond_lex_cost
%
predicate cond_lex_cost(array[int] of var int: v, array[int, int] of var int: a, var int: ix) =
      exists(i in index_set_1of2(a)) (
      ix = i
      /\
      forall(j in index_set(v)) (
         a[i,j] = v[j]
      ) 
    )
;


solve satisfy;

constraint
%    v1 = [0,1]
%    /\
    arr = [|1,0,
           |0,1,
           |0,0
           |1,1|]
    /\
    cond_lex_cost(v1, arr, pos)
;